DGtal 1.3.0
|
Aim: 3D specialization for BoundedRationalPolytope to add dimension specific static methods. More...
#include <DGtal/geometry/volumes/BoundedRationalPolytope.h>
Public Types | |
typedef TInteger | Integer |
typedef SpaceND< 3, Integer > | Space |
typedef Space::Point | Point |
typedef Space::Vector | Vector |
typedef BoundedRationalPolytope< Space > | Polytope |
Static Public Member Functions | |
static void | addEdgeConstraint (Polytope &P, unsigned int i, unsigned int j, const std::vector< Point > &pts) |
static Vector | crossProduct (const Vector &v1, const Vector &v2) |
Static Public Attributes | |
static const Dimension | dimension = Space::dimension |
Aim: 3D specialization for BoundedRationalPolytope to add dimension specific static methods.
Description of template class 'BoundedRationalPolytopeSpecializer'
TInteger | any model of integer. |
Definition at line 747 of file BoundedRationalPolytope.h.
typedef TInteger DGtal::detail::BoundedRationalPolytopeSpecializer< 3, TInteger >::Integer |
Definition at line 748 of file BoundedRationalPolytope.h.
typedef Space::Point DGtal::detail::BoundedRationalPolytopeSpecializer< 3, TInteger >::Point |
Definition at line 750 of file BoundedRationalPolytope.h.
typedef BoundedRationalPolytope< Space > DGtal::detail::BoundedRationalPolytopeSpecializer< 3, TInteger >::Polytope |
Definition at line 752 of file BoundedRationalPolytope.h.
typedef SpaceND< 3, Integer> DGtal::detail::BoundedRationalPolytopeSpecializer< 3, TInteger >::Space |
Definition at line 749 of file BoundedRationalPolytope.h.
typedef Space::Vector DGtal::detail::BoundedRationalPolytopeSpecializer< 3, TInteger >::Vector |
Definition at line 751 of file BoundedRationalPolytope.h.
|
inlinestatic |
This method add extremal constraints for simplex edges. Each constraint is a half-space bounded by the edge and one axis. Such constraints are useful when computing the Minkowski sum.
[in,out] | P | any polytope. |
[in] | i | any index in the vector of points pts. |
[in] | j | any index in the vector of points pts. |
[in] | pts | a vector of points defining a simplex. |
Definition at line 765 of file BoundedRationalPolytope.h.
References DGtal::PointVector< dim, Integer >::base(), DGtal::PointVector< dim, TEuclideanRing, TContainer >::crossProduct(), DGtal::BoundedRationalPolytope< TSpace >::cut(), and DGtal::detail::BoundedRationalPolytopeSpecializer< N, TInteger >::dimension.
|
inlinestatic |
Generic method for cross product, only implemented in 3D.
v1 | any vector |
v2 | any vector |
Definition at line 789 of file BoundedRationalPolytope.h.
References DGtal::PointVector< dim, TEuclideanRing, TContainer >::crossProduct().
|
static |
Definition at line 753 of file BoundedRationalPolytope.h.