The main class to run the basic API. More...

#include <politopixAPI.h>

Collaboration diagram for politopixAPI:

Static Public Member Functions
static polito_EXPORT int	savePolytope (const string &pathA, boost::shared_ptr< Polytope_Rn > &A)
	Save a polytope in the corresponding file name. More...

static polito_EXPORT int	savePolyhedralCone (const string &pathA, boost::shared_ptr< PolyhedralCone_Rn > &A)
	Save a polyhedral cone in the corresponding file name. More...

static polito_EXPORT int	loadPolytope (const string &pathA, boost::shared_ptr< Polytope_Rn > &A)
	Load a polytope from the corresponding file name. More...

static polito_EXPORT int	loadPolyhedralCone (const string &pathA, boost::shared_ptr< PolyhedralCone_Rn > &A)
	Load a polyhedral cone from the corresponding file name. More...

static polito_EXPORT int	addHalfspace (boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< HalfSpace_Rn > &HS)
	Add a new half-space into the polytope data structure. More...

static polito_EXPORT int	addGenerator (boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Generator_Rn > &GN)
	Add a new generator into the polytope data structure. More...

static polito_EXPORT int	computeDoubleDescription (boost::shared_ptr< Polytope_Rn > &A, double bb_size)
	Compute the HV-description for a given H-polytope or V-polytope with the Double Description algorithm. More...

static polito_EXPORT int	computeDoubleDescription (boost::shared_ptr< Polytope_Rn > &A)
	The same as computeDoubleDescription(A,bb_size) with bb_size=1000. for the boost python interface. More...

static polito_EXPORT int	computeDoubleDescriptionWithoutCheck (boost::shared_ptr< Polytope_Rn > &A, double bb_size=1000.)
	Compute the HV-description for a given H-polytope or V-polytope with the Double Description algorithm. More...

static polito_EXPORT int	computeIntersection (const boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B, boost::shared_ptr< Polytope_Rn > &C)
	Compute the intersection between two HV-polytopes with the Double Description algorithm. More...

static polito_EXPORT int	computeIntersection (boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B)
	Compute the intersection between two HV-polytopes with the Double Description algorithm. More...

static polito_EXPORT int	computeIntersectionWithoutCheck (boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B)
	Compute the intersection between two HV-polytopes with the Double Description algorithm. More...

static polito_EXPORT bool	isIncluded (const boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B)
	Test whether the polytope A V-description is inside the polytope B H-description. More...

static polito_EXPORT int	computeMinkowskiSumOfPolytopes (const boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B, boost::shared_ptr< Polytope_Rn > &C)
	Compute the Minkowski sum between two HV-polytopes. More...

static polito_EXPORT int	computeMinkowskiSumOfPolytopes (const std::vector< boost::shared_ptr< Polytope_Rn > > &arrayOfPol, boost::shared_ptr< Polytope_Rn > &C)
	Compute the Minkowski sum of several HV-polytopes stored in an array. More...

static polito_EXPORT int	computeMinkowskiSumOfPolytopes (const boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B, boost::shared_ptr< Polytope_Rn > &C, const std::vector< std::vector< int > > &genitorsOfGeneratorsA, const std::vector< std::vector< int > > &genitorsOfGeneratorsB, std::vector< std::vector< int > > &traceGenerators)
	Compute the Minkowski sum between two HV-polytopes tracing the generators. More...

static polito_EXPORT int	checkEqualityOfPolytopes (const boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B, bool getFaceMapping=false)
	Check whether two HV-polytopes are identical Check whether the vertices of A are inside B half-spaces and vice-versa. Perform also some topological verifications. More...

static polito_EXPORT bool	checkEqualityOfVertices (const boost::shared_ptr< Polytope_Rn > &A, const boost::shared_ptr< Polytope_Rn > &B)
	Check whether two V-polytopes are identical Check whether the sets of vertices of A and B are equal. More...

static polito_EXPORT int	checkTopologyAndGeometry (const boost::shared_ptr< PolyhedralCone_Rn > &A, bool check_all=false)
	Check whether a HV-polytopes is correct. More...

static polito_EXPORT int	makeCube (boost::shared_ptr< Polytope_Rn > &A, double M)
	Create a cube whose vertices will be (+-M, ..., +-M) More...

static polito_EXPORT int	makeBox (boost::shared_ptr< Polytope_Rn > &A, Point_Rn Pmin, Point_Rn Pmax)
	Create a box or rectangle parallelepiped whose corners are Pmin and Pmax. More...

static polito_EXPORT int	PolarPolytope (const boost::shared_ptr< Polytope_Rn > &original_pol, boost::shared_ptr< Polytope_Rn > &polar_pol)
	Compute the polar polytope. More...

static polito_EXPORT int	Translate (boost::shared_ptr< Polytope_Rn > &pol, const boost::numeric::ublas::vector< double > &v2t)
	Translate a polytope or polyhedral cone by the given vector. More...

static polito_EXPORT double	computeVolume (const boost::shared_ptr< Polytope_Rn > P)
	Return the volume of the given polytope P with its double description. The implemented algorithm can be found in Volume Computation for Polytopes: Strategies and Performances by Andreas Enge in Encyclopedia of Optimization 2nd edition, p 4032-4073. More...

static polito_EXPORT int	pseudoIntersection (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...

static polito_EXPORT int	pseudoSum (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.)
	Compute the Minkowski sum of two polytopes and then remove all cap half-spaces to truncate again. More...

static polito_EXPORT int	computeVoronoiDiagram (const boost::shared_ptr< Polytope_Rn > &inputSpace, const std::vector< Point_Rn > &listOfSeeds, std::vector< boost::shared_ptr< Polytope_Rn > > &VoronoiCells, Voronoi_Rn::TypeOfAlgorithm vorAlgo=Voronoi_Rn::Incremental)
	Compute the Voronoi Diagram in a n-dimensional space i.e. a partitioning of an input space into regions based on distance to points called seeds. More...

Detailed Description

The main class to run the basic API.

Definition at line 43 of file politopixAPI.h.

Member Function Documentation

◆ addGenerator()

int politopixAPI::addGenerator	(	boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Generator_Rn > &	GN
	)

static

Add a new generator into the polytope data structure.

Parameters

A	The current polytope
GN	The corresponding generator

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 80 of file politopixAPI.cpp.

◆ addHalfspace()

int politopixAPI::addHalfspace	(	boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< HalfSpace_Rn > &	HS
	)

static

Add a new half-space into the polytope data structure.

Parameters

A	The current polytope
HS	The corresponding half-space

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 75 of file politopixAPI.cpp.

◆ checkEqualityOfPolytopes()

int politopixAPI::checkEqualityOfPolytopes	(	const boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B,
		bool	getFaceMapping = `false`
	)

static

Check whether two HV-polytopes are identical Check whether the vertices of A are inside B half-spaces and vice-versa. Perform also some topological verifications.

Parameters

A	The 1st HV-polytope
B	The 2nd HV-polytope
getFaceMapping	If true, print the mapping between the generators and faces of both polytopes in case of equality.

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 463 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ checkEqualityOfVertices()

bool politopixAPI::checkEqualityOfVertices	(	const boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B
	)

static

Check whether two V-polytopes are identical Check whether the sets of vertices of A and B are equal.

Parameters

A	The 1st V-polytope
B	The 2nd V-polytope

Returns: true if
\[ \mathcal{V}_A = \mathcal{V}_B \]
, false otherwise.

Definition at line 500 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ checkTopologyAndGeometry()

int politopixAPI::checkTopologyAndGeometry	(	const boost::shared_ptr< PolyhedralCone_Rn > &	A,
		bool	check_all = `false`
	)

static

Check whether a HV-polytopes is correct.

Parameters

A	A HV-polytope

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 564 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ computeDoubleDescription() [1/2]

static polito_EXPORT int politopixAPI::computeDoubleDescription ( boost::shared_ptr< Polytope_Rn > & A )

inlinestatic

The same as computeDoubleDescription(A,bb_size) with bb_size=1000. for the boost python interface.

Definition at line 90 of file politopixAPI.h.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ computeDoubleDescription() [2/2]

int politopixAPI::computeDoubleDescription	(	boost::shared_ptr< Polytope_Rn > &	A,
		double	bb_size
	)

static

Compute the HV-description for a given H-polytope or V-polytope with the Double Description algorithm.

Parameters

A	The H-polytope or V-polytope
bb_size	The origin centered bounding box size providing the V-description

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 136 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ computeDoubleDescriptionWithoutCheck()

int politopixAPI::computeDoubleDescriptionWithoutCheck	(	boost::shared_ptr< Polytope_Rn > &	A,
		double	bb_size = `1000.`
	)

static

Compute the HV-description for a given H-polytope or V-polytope with the Double Description algorithm.

Parameters

A	The H-polytope or V-polytope

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 85 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ computeIntersection() [1/2]

int politopixAPI::computeIntersection	(	boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B
	)

static

Compute the intersection between two HV-polytopes with the Double Description algorithm.

Parameters

A	The 1st HV-polytope, then the result
B	The 2nd HV-polytope

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 143 of file politopixAPI.cpp.

Here is the call graph for this function:

◆ computeIntersection() [2/2]

int politopixAPI::computeIntersection	(	const boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B,
		boost::shared_ptr< Polytope_Rn > &	C
	)

static

Compute the intersection between two HV-polytopes with the Double Description algorithm.

Parameters

A	The 1st HV-polytope
B	The 2nd HV-polytope
C	The previously allocated result

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 195 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ computeIntersectionWithoutCheck()

int politopixAPI::computeIntersectionWithoutCheck	(	boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B
	)

static

Compute the intersection between two HV-polytopes with the Double Description algorithm.

Parameters

A	The 1st HV-polytope, then the result
B	The 2nd HV-polytope

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 298 of file politopixAPI.cpp.

Here is the call graph for this function:

◆ computeMinkowskiSumOfPolytopes() [1/3]

int politopixAPI::computeMinkowskiSumOfPolytopes	(	const boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B,
		boost::shared_ptr< Polytope_Rn > &	C
	)

static

Compute the Minkowski sum between two HV-polytopes.

Parameters

A	The 1st HV-polytope
B	The 2nd HV-polytope
C	The previously allocated sum

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 350 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ computeMinkowskiSumOfPolytopes() [2/3]

int politopixAPI::computeMinkowskiSumOfPolytopes	(	const boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B,
		boost::shared_ptr< Polytope_Rn > &	C,
		const std::vector< std::vector< int > > &	genitorsOfGeneratorsA,
		const std::vector< std::vector< int > > &	genitorsOfGeneratorsB,
		std::vector< std::vector< int > > &	traceGenerators
	)

static

Compute the Minkowski sum between two HV-polytopes tracing the generators.

Parameters

A	The 1st HV-polytope
B	The 2nd HV-polytope
C	The previously allocated sum
traceGenerators	Give for each generator of C, the list of numbers identifying its genitors in A and B

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 423 of file politopixAPI.cpp.

◆ computeMinkowskiSumOfPolytopes() [3/3]

int politopixAPI::computeMinkowskiSumOfPolytopes	(	const std::vector< boost::shared_ptr< Polytope_Rn > > &	arrayOfPol,
		boost::shared_ptr< Polytope_Rn > &	C
	)

static

Compute the Minkowski sum of several HV-polytopes stored in an array.

Parameters

arrayOfPol	The array of HV-polytopes
C	The previously allocated sum

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 386 of file politopixAPI.cpp.

◆ computeVolume()

double politopixAPI::computeVolume ( const boost::shared_ptr< Polytope_Rn > P )

static

Return the volume of the given polytope P with its double description. The implemented algorithm can be found in Volume Computation for Polytopes: Strategies and Performances by Andreas Enge in Encyclopedia of Optimization 2nd edition, p 4032-4073.

Definition at line 537 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ computeVoronoiDiagram()

int politopixAPI::computeVoronoiDiagram	(	const boost::shared_ptr< Polytope_Rn > &	inputSpace,
		const std::vector< Point_Rn > &	listOfSeeds,
		std::vector< boost::shared_ptr< Polytope_Rn > > &	VoronoiCells,
		Voronoi_Rn::TypeOfAlgorithm	vorAlgo = `Voronoi_Rn::Incremental`
	)

static

Compute the Voronoi Diagram in a n-dimensional space i.e. a partitioning of an input space into regions based on distance to points called seeds.

Parameters

inputSpace	The input HV-polytope, most of the times a parallelepiped
listOfSeeds	The list of points to be considered as seeds
VoronoiCells	The list of the returned HV-polytopes partitioning the input space
vorAlgo	The type of algorithm to be run: 0 = incremental, 1 = cell by cell

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 716 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ isIncluded()

bool politopixAPI::isIncluded	(	const boost::shared_ptr< Polytope_Rn > &	A,
		const boost::shared_ptr< Polytope_Rn > &	B
	)

static

Test whether the polytope A V-description is inside the polytope B H-description.

Parameters

A	The 1st V-polytope
B	The 2nd H-polytope

Returns: true if
\[ A \subset B \]
, false otherwise.

Definition at line 261 of file politopixAPI.cpp.

◆ loadPolyhedralCone()

int politopixAPI::loadPolyhedralCone	(	const string &	pathA,
		boost::shared_ptr< PolyhedralCone_Rn > &	A
	)

static

Load a polyhedral cone from the corresponding file name.

Parameters

pathA	The name of the current file
A	The previously allocated polyhedral cone

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 64 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ loadPolytope()

int politopixAPI::loadPolytope	(	const string &	pathA,
		boost::shared_ptr< Polytope_Rn > &	A
	)

static

Load a polytope from the corresponding file name.

Parameters

pathA	The name of the current file
A	The previously allocated polytope

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 40 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ makeBox()

int politopixAPI::makeBox	(	boost::shared_ptr< Polytope_Rn > &	A,
		Point_Rn	Pmin,
		Point_Rn	Pmax
	)

static

Create a box or rectangle parallelepiped whose corners are Pmin and Pmax.

Parameters

A	The box variable
Pmin	lower corner
Pmin	upper corner

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 574 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ makeCube()

int politopixAPI::makeCube	(	boost::shared_ptr< Polytope_Rn > &	A,
		double	M
	)

static

Create a cube whose vertices will be (+-M, ..., +-M)

Parameters

A	The cube variable
M	The cube half side length.

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 568 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ PolarPolytope()

int politopixAPI::PolarPolytope	(	const boost::shared_ptr< Polytope_Rn > &	original_pol,
		boost::shared_ptr< Polytope_Rn > &	polar_pol
	)

static

Compute the polar polytope.

Parameters

original_pol	The input polytope
polar_pol	The polar polytope

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 614 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ pseudoIntersection()

int politopixAPI::pseudoIntersection	(	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.`
	)

static

Remove all cap half-spaces and then compute the intersection of two capped polytopes.

Parameters

A	The 1st HV-polytope
B	The 2nd HV-polytope
C	The previously allocated intersection

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 622 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ pseudoSum()

int politopixAPI::pseudoSum	(	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.`
	)

static

Compute the Minkowski sum of two polytopes and then remove all cap half-spaces to truncate again.

Parameters

A	The 1st HV-polytope
B	The 2nd HV-polytope
C	The previously allocated sum

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 669 of file politopixAPI.cpp.

Here is the caller graph for this function:

◆ savePolyhedralCone()

int politopixAPI::savePolyhedralCone	(	const string &	pathA,
		boost::shared_ptr< PolyhedralCone_Rn > &	A
	)

static

Save a polyhedral cone in the corresponding file name.

Parameters

pathA	The name of the current file
A	The corresponding polyhedral cone

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 52 of file politopixAPI.cpp.

Here is the call graph for this function:

◆ savePolytope()

int politopixAPI::savePolytope	(	const string &	pathA,
		boost::shared_ptr< Polytope_Rn > &	A
	)

static

Save a polytope in the corresponding file name.

Parameters

pathA	The name of the current file
A	The corresponding polytope

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 29 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

◆ Translate()

int politopixAPI::Translate	(	boost::shared_ptr< Polytope_Rn > &	pol,
		const boost::numeric::ublas::vector< double > &	v2t
	)

static

Translate a polytope or polyhedral cone by the given vector.

Parameters

pol	The corresponding polytope
v2t	The translation vector

Returns: TEST_OK or 0 if the process was successful, TEST_KO or -1 if something went wrong.

Definition at line 618 of file politopixAPI.cpp.

Here is the call graph for this function:

Here is the caller graph for this function:

The documentation for this class was generated from the following files:

/mnt/c/Users/vindelos/Documents/TEST/TEST/co/politopix/trunk/politopixAPI.h
/mnt/c/Users/vindelos/Documents/TEST/TEST/co/politopix/trunk/politopixAPI.cpp

Static Public Member Functions

Detailed Description

Member Function Documentation

◆ addGenerator()

◆ addHalfspace()

◆ checkEqualityOfPolytopes()

◆ checkEqualityOfVertices()

◆ checkTopologyAndGeometry()

◆ computeDoubleDescription() [1/2]

◆ computeDoubleDescription() [2/2]

◆ computeDoubleDescriptionWithoutCheck()

◆ computeIntersection() [1/2]

◆ computeIntersection() [2/2]

◆ computeIntersectionWithoutCheck()

◆ computeMinkowskiSumOfPolytopes() [1/3]

◆ computeMinkowskiSumOfPolytopes() [2/3]

◆ computeMinkowskiSumOfPolytopes() [3/3]

◆ computeVolume()

◆ computeVoronoiDiagram()

◆ isIncluded()

◆ loadPolyhedralCone()

◆ loadPolytope()

◆ makeBox()

◆ makeCube()

◆ PolarPolytope()

◆ pseudoIntersection()

◆ pseudoSum()

◆ savePolyhedralCone()

◆ savePolytope()

◆ Translate()