DGtal
1.5.beta
|
Aim: This concept describes a cellular grid space in nD. In these spaces obtained by cartesian product, cells have a cubic shape that depends on the dimension: 0-cells are points, 1-cells are unit segments, 2-cells are squares, 3-cells are cubes, and so on. More...
#include <DGtal/topology/CCellularGridSpaceND.h>
Public Types | |
typedef T::Size | Size |
Public Types inherited from DGtal::concepts::CPreCellularGridSpaceND< T > | |
typedef T::Integer | Integer |
typedef T::Space | Space |
typedef T::PreCellularGridSpace | PreCellularGridSpace |
typedef T::Cell | Cell |
typedef T::SCell | SCell |
typedef T::Surfel | Surfel |
typedef T::Sign | Sign |
typedef T::DirIterator | DirIterator |
typedef T::Point | Point |
typedef T::Vector | Vector |
typedef T::Cells | Cells |
typedef T::SCells | SCells |
typedef T::CellSet | CellSet |
typedef T::SCellSet | SCellSet |
typedef T::SurfelSet | SurfelSet |
typedef int | Dummy |
typedef T::template CellMap< Dummy >::Type | CellMap |
typedef T::template SCellMap< Dummy >::Type | SCellMap |
typedef T::template SurfelMap< Dummy >::Type | SurfelMap |
Private Attributes | |
T | myX |
CPreCellularGridSpaceND< T >::Integer | myInteger |
Size | mySize |
Dimension | myDim |
CPreCellularGridSpaceND< T >::Point | myP1 |
CPreCellularGridSpaceND< T >::Point | myP2 |
CPreCellularGridSpaceND< T >::Cell | myCell |
CPreCellularGridSpaceND< T >::SCell | mySCell |
bool | myBool |
Aim: This concept describes a cellular grid space in nD. In these spaces obtained by cartesian product, cells have a cubic shape that depends on the dimension: 0-cells are points, 1-cells are unit segments, 2-cells are squares, 3-cells are cubes, and so on.
Description of concept 'CCellularGridSpaceND'
In addition of CPreCellularGridSpaceND, CCellularGridSpaceND add bounds and related methods.
Models of CCellularGridSpaceND are used whenever you need to define a topology on your subsets of the digital space, especially boundaries of objects, curves and digital surfaces.
The space is generally finite (except for arbitrary size integers). The user should choose between a closed (default) cell space or an open cell space.
We refer the reader to Cellular grid space and topology, unoriented and oriented cells, incidence for further details.
Name | Expression | Type requirements | Return type | Precondition | Semantics | Post condition | Complexity |
---|---|---|---|---|---|---|---|
initialization | x.init(p1, p2, b) | b is bool | bool | initializes the space so that cells are within the bounds p1 and p2, returns true iff the initialization was valid (ie, such bounds are representable with these integers). | |||
Size or width | x.size( k ) | Integer | returns the size/width of the space along the axis k | ||||
Minimal coordinate | x.min( k ) | Integer | returns the minimal possible digital coordinate along the axis k | ||||
Maximal coordinate | x.max( k ) | Integer | returns the maximal possible digital coordinate along the axis k | ||||
Lower bound | x.lowerBound() | Point | returns the lowest point in the space, i.e. p1 | ||||
Upper bound | x.upperBound() | Point | returns the uppermost point in the space, i.e. p1 | ||||
Lower cell | x.lowerCell() | Cell | returns the lowest cell in the space | ||||
Upper cell | x.upperCell() | Cell | returns the uppermost cell in the space | ||||
Closedness | x.isSpaceClosed() | bool | returns 'true' iff the cellular space is closed | ||||
Get first cell | x.uFirst(c) | Cell | returns the first cell of the space with same topology as c | ||||
Get last cell | x.uLast(c) | Cell | returns the last cell of the space with same topology as c | ||||
Get maximal cell along some axis | x.uGetMax(c,k) | Cell | returns the same cell as c except the k-th coordinate that is the maximal possible | ||||
Get minimal cell along some axis | x.uGetMin(c,k) | Cell | returns the same cell as c except the k-th coordinate that is the minimal possible | ||||
Distance to upper bound | x.uDistanceToMax(c,k) | Integer | returns the number of increments to do along the k-th axis to reach the upper bound | ||||
Distance to lower bound | x.uDistanceToMin(c,k) | Integer | returns the number of decrements to do along the k-th axis to reach the lower bound | ||||
Get first cell | x.sFirst(sc) | SCell | returns the first cell of the space with same topology as sc | ||||
Get last cell | x.sLast(sc) | SCell | returns the last cell of the space with same topology as sc | ||||
Get maximal cell along some axis | x.sGetMax(sc,k) | SCell | returns the same cell as sc except the k-th coordinate that is the maximal possible | ||||
Get minimal cell along some axis | x.sGetMin(sc,k) | SCell | returns the same cell as sc except the k-th coordinate that is the minimal possible | ||||
Distance to upper bound | x.sDistanceToMax(sc,k) | Integer | returns the number of increments to do along the k-th axis to reach the upper bound | ||||
Distance to lower bound | x.sDistanceToMin(sc,k) | Integer | returns the number of decrements to do along the k-th axis to reach the lower bound |
T | the type that should be a model of CCellularGridSpaceND. |
Definition at line 162 of file CCellularGridSpaceND.h.
typedef T::Size DGtal::concepts::CCellularGridSpaceND< T >::Size |
Definition at line 167 of file CCellularGridSpaceND.h.
DGtal::concepts::CCellularGridSpaceND< T >::BOOST_CONCEPT_ASSERT | ( | (CIntegralNumber< Size >) | ) |
DGtal::concepts::CCellularGridSpaceND< T >::BOOST_CONCEPT_ASSERT | ( | (CUnsignedNumber< Size >) | ) |
|
inline |
Definition at line 172 of file CCellularGridSpaceND.h.
References DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints(), DGtal::concepts::CCellularGridSpaceND< T >::myBool, DGtal::concepts::CCellularGridSpaceND< T >::myP1, DGtal::concepts::CCellularGridSpaceND< T >::myP2, DGtal::concepts::CCellularGridSpaceND< T >::myX, and DGtal::concepts::ConceptUtils::sameType().
|
inline |
Definition at line 177 of file CCellularGridSpaceND.h.
References DGtal::concepts::CCellularGridSpaceND< T >::myBool, DGtal::concepts::CCellularGridSpaceND< T >::myCell, DGtal::concepts::CCellularGridSpaceND< T >::myDim, DGtal::concepts::CCellularGridSpaceND< T >::myInteger, DGtal::concepts::CCellularGridSpaceND< T >::myP1, DGtal::concepts::CCellularGridSpaceND< T >::myP2, DGtal::concepts::CCellularGridSpaceND< T >::mySCell, DGtal::concepts::CCellularGridSpaceND< T >::mySize, DGtal::concepts::CCellularGridSpaceND< T >::myX, and DGtal::concepts::ConceptUtils::sameType().
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::BOOST_CONCEPT_USAGE().
|
private |
Definition at line 212 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::BOOST_CONCEPT_USAGE(), and DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 210 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 208 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 206 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 209 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::BOOST_CONCEPT_USAGE(), and DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 209 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::BOOST_CONCEPT_USAGE(), and DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 211 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 207 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().
|
private |
Definition at line 205 of file CCellularGridSpaceND.h.
Referenced by DGtal::concepts::CCellularGridSpaceND< T >::BOOST_CONCEPT_USAGE(), and DGtal::concepts::CCellularGridSpaceND< T >::checkConstConstraints().