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

Collaboration diagram for PseudoIntersectionWithoutCaps:

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...

Detailed Description

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

Definition at line 304 of file PolyhedralAlgorithms_Rn.h.

Constructor & Destructor Documentation

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.

Here is the call 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/PolyhedralAlgorithms_Rn.h
/mnt/c/Users/vindelos/Documents/TEST/TEST/co/politopix/trunk/PolyhedralAlgorithms_Rn.cpp