Hpolytope

A H-polytope is a convex polytope defined by a set of linear inequalities or equivalently a \(d\)-dimensional H-polytope with \(m\) facets is defined by a \(m\times d\) matrix A and a \(m\)-dimensional vector b, s.t.: \(Ax\leq b\).

Provides an R interface for 'volesti' C++ package. 'volesti' computes
estimations of volume of polytopes given by a set of points or linear inequalities
or Minkowski sum of segments (zonotopes). There are two algorithms for volume
estimation (I.Z. Emiris and V. Fisikopoulos (2014) <arXiv:1312.2873> and
B. Cousins, S. Vempala (2016) <arXiv:1409.6011>) as well as algorithms for sampling,
rounding and rotating polytopes. Moreover, 'volesti' provides algorithms for
estimating copulas (L. Cales, A. Chalkis, I.Z. Emiris, V. Fisikopoulos (2018)
<arXiv:1803.05861>).

Vissarion Fisikopoulos

volesti

Volume Approximation and Sampling of Convex Polytopes

Hpolytope function

<ul>
<li><code>A</code> A \(m\times d\) numerical matrix A</li>
<li><code>b</code> \(m\)-dimensional vector b</li>
<li><code>type</code> An integer that declares the representation of the polytope. For H-representation the default value is 1.</li>
<li><code>dimension</code> An integer that declares the dimension of the polytope.</li>
</ul>

Hpolytope: An `R` class to represent H-polytopes.

Description

Arguments

Fields