Rcpp_VpolytopeIntersection-class

[,Rcpp_VpolytopeIntersection-method

[,Rcpp_VpolytopeIntersection,ANY,ANY,ANY-method

$&lt;-,Rcpp_VpolytopeIntersection-method

$,Rcpp_VpolytopeIntersection-method

filepaths&lt;-,Rcpp_VpolytopeIntersection-method

<p>An intersection of two V-polytopes, $P_1$, $P_2$, is defined by the intersection of the two coresponding convex hulls.</p>

internal

Rcpp_VpolytopeIntersection

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

Rcpp_VpolytopeIntersection function

An <code>Rcpp</code> class to represent the intersection of two V-polytope, exposed to <code>R</code> via modules. — Rcpp_VpolytopeIntersection

An <code>Rcpp</code> class to represent the intersection of two V-polytope, exposed to <code>R</code> via modules.

Rcpp_VpolytopeIntersection: An `Rcpp` class to represent the intersection of two V-polytope, exposed to `R` via modules.

Description

Arguments

Details