DGtal 1.4.2
|
#include <DGtal/geometry/volumes/PConvexity.h>
Public Types | |
using | Integer = TInteger |
using | Point = DGtal::PointVector< dim, Integer > |
using | ProjPoint = DGtal::PointVector< dim-1, Integer > |
using | ProjPConvexity = DGtal::detail::RecursivePConvexity< dim - 1, Integer > |
Public Member Functions | |
BOOST_CONCEPT_ASSERT ((concepts::CInteger< TInteger >)) | |
Integer must be a model of the concept CInteger. | |
RecursivePConvexity (Dimension bd=dim) | |
void | init (Dimension bd=dim) |
bool | isPConvex (const std::vector< Point > &X, bool safe) const |
double | fullConvexityMeasure (const std::vector< Point > &X, bool safe) const |
Static Public Member Functions | |
static bool | is0Convex (const std::vector< Point > &X, bool safe) |
static double | convexityMeasure (const std::vector< Point > &X, bool safe) |
static ProjPoint | project (const Point &p, Dimension a) |
static std::vector< ProjPoint > | project (const std::vector< Point > &p, Dimension a) |
Data Fields | |
std::vector< ProjPConvexity > | projp |
The array of lower dimensional P-convexities. | |
Hidden class to represent the P-convexity in a recursive way. Only used to compute P-convexity, but not exposed to users.
dim | the dimension of the digital space |
TInteger | any model of integer (used to represent digital point coordinates). |
Definition at line 66 of file PConvexity.h.
using DGtal::detail::RecursivePConvexity< dim, TInteger >::Integer = TInteger |
Definition at line 69 of file PConvexity.h.
using DGtal::detail::RecursivePConvexity< dim, TInteger >::Point = DGtal::PointVector< dim, Integer > |
Definition at line 70 of file PConvexity.h.
using DGtal::detail::RecursivePConvexity< dim, TInteger >::ProjPConvexity = DGtal::detail::RecursivePConvexity< dim - 1, Integer > |
Definition at line 72 of file PConvexity.h.
using DGtal::detail::RecursivePConvexity< dim, TInteger >::ProjPoint = DGtal::PointVector< dim-1, Integer > |
Definition at line 71 of file PConvexity.h.
|
inline |
Parameter bd is used to build exactly 2^d - 1 PConvexity objects when starting at dimension d.
bd | the maximum axis of projection. |
Definition at line 77 of file PConvexity.h.
References DGtal::detail::RecursivePConvexity< dim, TInteger >::init().
DGtal::detail::RecursivePConvexity< dim, TInteger >::BOOST_CONCEPT_ASSERT | ( | (concepts::CInteger< TInteger >) | ) |
Integer must be a model of the concept CInteger.
|
inlinestatic |
X | any range of lattice points (without duplicates) |
safe | when 'true' performs convex hull computations with arbitrary precision integer (if available), otherwise chooses a compromise between speed and precision (int64_t). |
Definition at line 155 of file PConvexity.h.
References DGtal::ConvexityHelper< dim, TInteger, TInternalInteger >::computeLatticePolytope().
Referenced by DGtal::PConvexity< TSpace >::convexityMeasure(), DGtal::detail::RecursivePConvexity< dim, TInteger >::fullConvexityMeasure(), and DGtal::detail::RecursivePConvexity< 1, TInteger >::fullConvexityMeasure().
|
inline |
X | any range of lattice points (without duplicates) |
safe | when 'true' performs convex hull computations with arbitrary precision integer (if available), otherwise chooses a compromise between speed and precision (int64_t). |
Definition at line 189 of file PConvexity.h.
References DGtal::detail::RecursivePConvexity< dim, TInteger >::convexityMeasure(), DGtal::detail::RecursivePConvexity< dim, TInteger >::project(), and DGtal::detail::RecursivePConvexity< dim, TInteger >::projp.
Referenced by DGtal::PConvexity< TSpace >::fullConvexityMeasure().
|
inline |
bd | the maximum axis of projection. |
Definition at line 83 of file PConvexity.h.
References DGtal::detail::RecursivePConvexity< dim, TInteger >::projp.
Referenced by DGtal::detail::RecursivePConvexity< dim, TInteger >::RecursivePConvexity().
|
inlinestatic |
X | any range of lattice points (without duplicates) |
safe | when 'true' performs convex hull computations with arbitrary precision integer (if available), otherwise chooses a compromise between speed and precision (int64_t). |
Definition at line 100 of file PConvexity.h.
References DGtal::ConvexityHelper< dim, TInteger, TInternalInteger >::computeLatticePolytope().
Referenced by DGtal::PConvexity< TSpace >::is0Convex(), DGtal::detail::RecursivePConvexity< dim, TInteger >::isPConvex(), and DGtal::detail::RecursivePConvexity< 1, TInteger >::isPConvex().
|
inline |
X | any range of lattice points (without duplicates) |
safe | when 'true' performs convex hull computations with arbitrary precision integer (if available), otherwise chooses a compromise between speed and precision (int64_t). |
Definition at line 133 of file PConvexity.h.
References DGtal::detail::RecursivePConvexity< dim, TInteger >::is0Convex(), DGtal::detail::RecursivePConvexity< dim, TInteger >::isPConvex(), DGtal::detail::RecursivePConvexity< dim, TInteger >::project(), and DGtal::detail::RecursivePConvexity< dim, TInteger >::projp.
Referenced by DGtal::detail::RecursivePConvexity< dim, TInteger >::isPConvex(), and DGtal::PConvexity< TSpace >::isPConvex().
|
inlinestatic |
Projects a point p along dimension a.
[in] | p | any digital point |
[in] | a | any dimension |
Definition at line 206 of file PConvexity.h.
References DGtal::PointVector< dim, Integer >::dimension.
Referenced by DGtal::detail::RecursivePConvexity< dim, TInteger >::fullConvexityMeasure(), DGtal::detail::RecursivePConvexity< dim, TInteger >::isPConvex(), and DGtal::detail::RecursivePConvexity< dim, TInteger >::project().
|
inlinestatic |
Projects the range of points p along dimension a.
[in] | p | any range of digital points |
[in] | a | any dimension |
Definition at line 225 of file PConvexity.h.
References DGtal::detail::RecursivePConvexity< dim, TInteger >::project().
std::vector< ProjPConvexity > DGtal::detail::RecursivePConvexity< dim, TInteger >::projp |
The array of lower dimensional P-convexities.
Definition at line 237 of file PConvexity.h.
Referenced by DGtal::detail::RecursivePConvexity< dim, TInteger >::fullConvexityMeasure(), DGtal::detail::RecursivePConvexity< dim, TInteger >::init(), and DGtal::detail::RecursivePConvexity< dim, TInteger >::isPConvex().