24 #include <boost/shared_ptr.hpp>
64 bool checkEqualityOfVertices(
const boost::shared_ptr<Polytope_Rn>& B,
bool printOnScreen =
false)
const;
69 const boost::shared_ptr<Generator_Rn_SD>& in,
70 const boost::shared_ptr<Generator_Rn_SD>& out,
71 boost::shared_ptr<Generator_Rn_SD> newV,
double ay,
double az,
double b=0.)
const;
75 boost::shared_ptr<PolyhedralCone_Rn> getPrimalCone(
unsigned int i)
const throw (std::out_of_range);
78 boost::shared_ptr<PolyhedralCone_Rn> getPrimalCone(
const boost::shared_ptr<Generator_Rn>& vx)
const;
virtual unsigned int numberOfGeneratorsPerFacet() const
Each facet in a polytope has got n vertices.
virtual bool isBounded() const
Tell whether this polyhedron is bounded or not, polytopes are bounded.
Model a polytope using its two equivalent definitions : the convex hull and the half-space intersecti...
Polytope_Rn()
Constructor for polytopes i.e. bounded convex polyhedra.
Model a polyhedral cone using its two equivalent definitions : the convex hull and the half-space int...
virtual bool checkEdges() const
Always true in the polyhedral cone case.
virtual void createBoundingBox(double)
At the moment this function is useless in the case of polyhedral cones.
virtual void createTruncatedGenerator(const boost::shared_ptr< Generator_Rn_SD > &y, const boost::shared_ptr< Generator_Rn_SD > &z, boost::shared_ptr< Generator_Rn_SD > newG, double ay, double az, double b=0.) const
Create the intersection edge in the truncating algorithm. It is defined by the intersection between a...
virtual void createBoundingSimplex(double)
At the moment this function is useless in the case of polyhedral cones.
virtual unsigned int neigbourhoodCondition() const
Two vertices are neighbours in a polytope <=> they share at least (n-1) facets.
virtual ~Polytope_Rn()
Destructor.
virtual unsigned int dimension() const
Return the space dimension.