DGtal Concepts

Namespaces
namespace	DGtal

Data Structures
struct	DGtal::CPositiveIrreducibleFraction< T >
	Aim: Defines positive irreducible fractions, i.e. fraction p/q, p and q non-negative integers, with gcd(p,q)=1. More...
struct	DGtal::CBackInsertable< T >
	Aim: Represents types for which a std::back_insert_iterator can be constructed with std::back_inserter. Back Insertion Sequence are refinements of CBackInsertable. They require more services than CBackInsertable, for instance read services or erase services. More...
struct	DGtal::CBidirectionalOutputRange< T, Value >
	Aim: refined concept of bidirectional range which require that a reverse output iterator exists. More...
struct	DGtal::CBidirectionalOutputRangeFromPoint< T, Value >
	Aim: refined concept of single pass range with an routputIterator() method from a point. More...
struct	DGtal::CBidirectionalRange< T >
	Aim: Defines the concept describing a bidirectional range. More...
struct	DGtal::CBidirectionalRangeFromPoint< T >
	Aim: refined concept of single pass range with a begin() method from a point. More...
struct	DGtal::CConstBidirectionalRangeFromPoint< T >
	Aim: refined concept of const bidirectional range with a begin() method from a point. More...
struct	DGtal::CConstSinglePassRange< T >
	Aim: Defines the concept describing a const range. More...
struct	DGtal::CConstSinglePassRangeFromPoint< T >
	Aim: refined concept of const single pass range with a begin() method from a point. More...
struct	DGtal::CLabel< T >
	Aim: Define the concept of DGtal labels. Models of CLabel can be default-constructible, assignable and equality comparable. More...
struct	DGtal::CPredicate< T, TElement >
	Aim: Defines a predicate function, ie. a functor mapping a domain into the set of booleans. More...
struct	DGtal::CQuantity< T >
	Aim: defines the concept of quantity in DGtal. More...
struct	DGtal::CSinglePassOutputRange< T, Value >
	Aim: refined concept of single pass range which require that an output iterator exists. More...
struct	DGtal::CSinglePassOutputRangeFromPoint< T, Value >
	Aim: refined concept of single pass range with a outputIterator() method from a point. More...
struct	DGtal::CSinglePassRange< T >
	Aim: Defines the concept describing a range. More...
struct	DGtal::CSinglePassRangeFromPoint< T >
	Aim: refined concept of single pass range with a begin() method from a point. More...
struct	DGtal::CUnaryFunctor< X, A, R >
	Aim: Defines a unary functor, which associates arguments to results. More...
struct	DGtal::CBidirectionalSegmentComputer< T >
	Aim: Defines the concept describing a bidirectional segment computer, ie. a model of CSegment that can extend itself in the two possible directions. More...
struct	DGtal::CDynamicBidirectionalSegmentComputer< T >
	Aim: Defines the concept describing a dynamic and bidirectional segment computer, ie. a model of CSegment that can extend and retract itself in either direction. More...
struct	DGtal::CDynamicSegmentComputer< T >
	Aim: Defines the concept describing a dynamic segment computer, ie. a model of CSegment that can extend and retract itself (in the direction that is relative to the underlying iterator). More...
struct	DGtal::CForwardSegmentComputer< T >
	Aim: Defines the concept describing a forward segment computer. Like any model of CIncrementalSegmentComputer, it can control its own extension (in the direction that is relative to the underlying iterator) so that an implicit predicate P remains true. However, contrary to models of CIncrementalSegmentComputer, it garantees that P is also true for any subrange of the whole segment at any time. This extra constraint is necessary to be able to incrementally check whether or not the segment is maximal. More...
struct	DGtal::CIncrementalSegmentComputer< T >
	Aim: Defines the concept describing an incremental segment computer, ie. a model of CSegmentFactory that can, in addition, incrementally check whether or not an implicit predicate P is true. In other words, it can control its own extension from a range of one element (in the direction that is relative to the underlying iterator) so that an implicit predicate P remains true. More...
struct	DGtal::CSegment< T >
	Aim: Defines the concept describing a segment, ie. a valid and not empty range. More...
struct	DGtal::CSegmentFactory< T >
	Aim: Defines the concept describing a segment ie. a valid and not empty subrange, which can construct instances of its own type or of derived type. More...
struct	DGtal::CGlobalGeometricEstimator< T >
	Aim: This concept describes an object that can process a range so as to return one estimated quantity for the whole range. More...
struct	DGtal::CLocalGeometricEstimator< T >
	Aim: This concept describes an object that can process a range so as to return one estimated quantity for each element of the range (or a given subrange). More...
struct	DGtal::CSegmentComputerEstimator< T >
	Aim: This concept is a refinement of CLocalGeometricEstimator devoted to the estimation of a geometric quantiy along a segment detected by a segment computer. More...
struct	DGtal::CConvolutionWeights< T >
	Aim: defines models of centered convolution kernel used for normal vector integration for instance. More...
struct	DGtal::CNormalVectorEstimator< T >
	Aim: Represents the concept of estimator of normal vector along digital surfaces. More...
struct	DGtal::CSeparableMetric< T >
struct	DGtal::CConstImage< I >
struct	DGtal::CImage< I >
struct	DGtal::CTrivialConstImage< I >
struct	DGtal::CTrivialImage< I >
struct	DGtal::CDrawableWithBoard2D< T >
struct	DGtal::CDrawableWithDisplay3D< T >
struct	DGtal::CColorMap< CMap >
	Aim: Defines the concept describing a color map. A color map converts a value within a given range into an RGB triple. More...
struct	DGtal::CBoundedInteger< T >
	Aim: The concept CBoundedInteger specifies what are the bounded integer numbers. Hence, it is a refinement of CInteger Concept ensuring that the numbers are bounded. More...
struct	DGtal::CCommutativeRing< T >
	Aim: Defines the mathematical concept equivalent to a unitary commutative ring. More...
struct	DGtal::CEuclideanRing< T >
	Aim: Defines the mathematical concept equivalent to a unitary commutative ring with a division operator. More...
struct	DGtal::CInteger< T >
	Aim: The concept CInteger specifies what are the usual integer numbers, more precisely the ones that are representable on a computer. More...
struct	DGtal::CPointEmbedder< T >
	Aim: A point embedder is a mapping from digital points to Euclidean points. It adds inner types to functor. More...
struct	DGtal::CPointFunctor< T >
	Aim: Defines a functor on points. More...
struct	DGtal::CPointPredicate< T >
	Aim: Defines a predicate on a point. More...
struct	DGtal::CSignedInteger< T >
	Aim: Concept checking for Signed Integer. More...
struct	DGtal::CSpace< T >
	Aim: Defines the concept describing a digital space, ie a cartesian product of integer lines. More...
struct	DGtal::CUnsignedInteger< T >
	Aim: Concept checking for Unsigned Integer. More...
struct	DGtal::CWithGradientMap< T >
	Aim: Such object provides a gradient map that associates to each argument some real vector. More...
struct	DGtal::CDigitalSet< T >
	Aim: Represents a set of points within the given domain. This set of points is modifiable by the user. More...
struct	DGtal::CDigitalBoundedShape< TShape >
struct	DGtal::CDigitalOrientedShape< T >
	Aim: characterizes models of digital oriented shapes. For example, models should provide an orientation method for points on a SpaceND. Returned value type corresponds to DGtal::Orientation. More...
struct	DGtal::CEuclideanBoundedShape< TShape >
struct	DGtal::CEuclideanOrientedShape< T >
	Aim: characterizes models of digital oriented shapes. For example, models should provide an orientation method for real points. Returned value type corresponds to DGtal::Orientation. More...
struct	DGtal::CImplicitFunction< T >
	Aim: Describes any function of the form f(x), where x is some real point in the given space, and f(x) is some value. More...
struct	DGtal::CImplicitFunctionDiff1< T >
	Aim: Describes a 1-differentiable function of the form f(x), where x is some real point in the given space, and f(x) is some value. More...
struct	DGtal::CAdjacency< Adj >
	Aim: The concept CAdjacency defines an elementary adjacency relation between points of a digital space. More...
struct	DGtal::CCellEmbedder< T >
	Aim: A cell embedder is a mapping from unsigned cells to Euclidean points. It adds inner types to functor. More...
struct	DGtal::CCellularGridSpaceND< T >
	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...
struct	DGtal::CDigitalSurfaceContainer< T >
	Aim: More...
struct	DGtal::CDigitalSurfaceEmbedder< T >
	Aim: A digital surface embedder is a specialized mapping from signed cells to Euclidean points. It adds inner types to functor as well as a method to access the digital surface. More...
struct	DGtal::CDigitalSurfaceTracker< T >
	Aim: More...
struct	DGtal::CDomainAdjacency< T >
	Aim: Refines the concept CAdjacency by telling that the adjacency is specific to a given domain of the embedding digital space. More...
struct	DGtal::CSCellEmbedder< T >
	Aim: A cell embedder is a mapping from signed cells to Euclidean points. It adds inner types to functor. More...
struct	DGtal::CSurfelPredicate< T >
	Aim: Defines a predicate on a surfel. More...
struct	DGtal::CUndirectedSimpleGraph< T >
	Aim: Represents the concept of local graph: each vertex has neighboring vertices, but we do not necessarily know all the vertices. More...
struct	DGtal::CUndirectedSimpleLocalGraph< T >
	Aim: Represents the concept of local graph: each vertex has neighboring vertices, but we do not necessarily know all the vertices. More...
struct	DGtal::CVertexMap< T >
	Aim: models of CVertexMap concept implement mapping between graph vertices and values. More...
struct	DGtal::CVertexPredicate< T >
	Aim: Defines a predicate on a vertex. More...

---

Detailed Description