VpolytopeIntersection

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

Provides an R interface for 'volesti' C++ package. 'volesti' computes estimations of volume
of polytopes given by (i) a set of points, (ii) linear inequalities or (iii) Minkowski sum of segments
(a.k.a. zonotopes). There are three algorithms for volume estimation as well as algorithms
for sampling, rounding and rotating polytopes. Moreover, 'volesti' provides algorithms for
estimating copulas useful in computational finance.

Vissarion Fisikopoulos

volesti

Volume Approximation and Sampling of Convex Polytopes

VpolytopeIntersection 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 this polytope the default value is 4.</li>
<li><code>dimension</code> The dimension of the polytope.</li>
<li><code>volume</code> The volume of the polytope, if it is known.</li>
</ul>

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

Description

Arguments

Fields