politopix
4.1.0
|
Remove all cap half-spaces and then compute the intersection of two capped polytopes. More...
#include <PolyhedralAlgorithms_Rn.h>
Public Member Functions | |
PseudoIntersectionWithoutCaps (const boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B, boost::shared_ptr< Polytope_Rn > &C, const std::set< unsigned int > &firstOperandCaps, const std::set< unsigned int > &secondOperandCaps, std::set< unsigned int > &newCaps, double bb_size=1000.) | |
Remove all cap half-spaces and then compute the intersection of two capped polytopes. More... | |
Remove all cap half-spaces and then compute the intersection of two capped polytopes.
Definition at line 306 of file PolyhedralAlgorithms_Rn.h.
PseudoIntersectionWithoutCaps::PseudoIntersectionWithoutCaps | ( | const boost::shared_ptr< Polytope_Rn > & | A, |
const boost::shared_ptr< Polytope_Rn > & | B, | ||
boost::shared_ptr< Polytope_Rn > & | C, | ||
const std::set< unsigned int > & | firstOperandCaps, | ||
const std::set< unsigned int > & | secondOperandCaps, | ||
std::set< unsigned int > & | newCaps, | ||
double | bb_size = 1000. |
||
) |
Remove all cap half-spaces and then compute the intersection of two capped polytopes.
Definition at line 1141 of file PolyhedralAlgorithms_Rn.cpp.