DGtal 2.1.0
|
Public Types | |
typedef CubicalComplex::KSpace | KSpace |
typedef CubicalComplex::Point | Point |
typedef CubicalComplex::Cell | Cell |
typedef CubicalComplex::CellMapIterator | CellMapIterator |
Public Member Functions | |
DiagonalPriority (const CubicalComplex &complex) | |
bool | operator() (const CellMapIterator &it1, const CellMapIterator &it2) const |
Data Fields | |
const CubicalComplex & | myComplex |
The diagonal property induces that cells further away from the straight line (1,..,1)*x are removed first in a collapse operation. Could be used instead of giving values to each cell data.
Definition at line 90 of file cubical-complex-collapse.cpp.
typedef CubicalComplex::Cell DiagonalPriority< CubicalComplex >::Cell |
Definition at line 93 of file cubical-complex-collapse.cpp.
typedef CubicalComplex::CellMapIterator DiagonalPriority< CubicalComplex >::CellMapIterator |
Definition at line 94 of file cubical-complex-collapse.cpp.
typedef CubicalComplex::KSpace DiagonalPriority< CubicalComplex >::KSpace |
Definition at line 91 of file cubical-complex-collapse.cpp.
typedef CubicalComplex::Point DiagonalPriority< CubicalComplex >::Point |
Definition at line 92 of file cubical-complex-collapse.cpp.
|
inline |
Definition at line 96 of file cubical-complex-collapse.cpp.
|
inline |
Definition at line 97 of file cubical-complex-collapse.cpp.
References DGtal::PointVector< dim, Integer >::diagonal(), DGtal::KhalimskySpaceND< dim, TInteger >::dimension, DGtal::PointVector< dim, TEuclideanRing, TContainer >::dot(), DiagonalPriority< CubicalComplex >::myComplex, and DGtal::CubicalComplex< TKSpace, TCellContainer >::space().
const CubicalComplex& DiagonalPriority< CubicalComplex >::myComplex |
Definition at line 110 of file cubical-complex-collapse.cpp.
Referenced by DiagonalPriority< CubicalComplex >::operator()().