IntVP

An intersection of two V-polytopes, \(P_1\), \(P_2\), is defined by the intersection of the two coresponding convex hulls.

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

IntVP function

<ul>
<li><code>V1</code> The numerical matrix that contains the vertices of \(P_1\) row-wise.</li>
<li><code>V2</code> The numerical matrix that contains the vertices of \(P_2\) row-wise.</li>
<li><code>type</code> An integer that declares the representation of the polytope. For these kinf of polytopes the default value is 4.</li>
<li><code>dimension</code> An integer that declares the dimension of the polytope.</li>
</ul>

IntVP: An `R` class to represent the intersection of two V-polytopes.

Description

Arguments

Fields