DGtal  1.0.0
Data Structures
DGtal Concepts

Data Structures

struct  DGtal::concepts::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::concepts::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::concepts::CBidirectionalRange< T >
 Aim: Defines the concept describing a bidirectional range. More...
 
struct  DGtal::concepts::CBidirectionalRangeFromPoint< T >
 Aim: refined concept of single pass range with a begin() method from a point. More...
 
struct  DGtal::concepts::CBidirectionalRangeWithWritableIterator< T, Value >
 Aim: refined concept of bidirectional range which require that a reverse output iterator exists. More...
 
struct  DGtal::concepts::CBidirectionalRangeWithWritableIteratorFromPoint< T, Value >
 Aim: refined concept of single pass range with an routputIterator() method from a point. More...
 
struct  DGtal::concepts::CConstBidirectionalRange< T >
 Aim: Defines the concept describing a bidirectional const range. More...
 
struct  DGtal::concepts::CConstBidirectionalRangeFromPoint< T >
 Aim: refined concept of const bidirectional range with a begin() method from a point. More...
 
struct  DGtal::concepts::CConstSinglePassRange< T >
 Aim: Defines the concept describing a const single pass range. More...
 
struct  DGtal::concepts::CConstSinglePassRangeFromPoint< T >
 Aim: refined concept of const single pass range with a begin() method from a point. More...
 
struct  DGtal::concepts::CLabel< T >
 Aim: Define the concept of DGtal labels. Models of CLabel can be default-constructible, assignable and equality comparable. More...
 
struct  DGtal::concepts::CPredicate< T, TElement >
 Aim: Defines a predicate function, ie. a functor mapping a domain into the set of booleans. More...
 
struct  DGtal::concepts::CQuantity< T >
 Aim: defines the concept of quantity in DGtal. More...
 
struct  DGtal::concepts::CSinglePassRange< T >
 Aim: Defines the concept describing a range. More...
 
struct  DGtal::concepts::CSinglePassRangeFromPoint< T >
 Aim: refined concept of single pass range with a begin() method from a point. More...
 
struct  DGtal::concepts::CSinglePassRangeWithWritableIterator< T, Value >
 Aim: refined concept of const single pass range which require that an output iterator exists. More...
 
struct  DGtal::concepts::CSinglePassRangeWithWritableIteratorFromPoint< T, Value >
 Aim: refined concept of single pass range with a outputIterator() method from a point. More...
 
struct  DGtal::concepts::CStack< T >
 Aim: This concept gathers classes that provide a stack interface. More...
 
struct  DGtal::concepts::CSTLAssociativeContainer< T >
 Aim: Defines the concept describing an Associative Container of the STL (https://www.sgi.com/tech/stl/AssociativeContainer.html). More...
 
struct  DGtal::concepts::CUnaryFunctor< X, A, R >
 Aim: Defines a unary functor, which associates arguments to results. More...
 
struct  DGtal::concepts::CDiscreteExteriorCalculusVectorSpace< T >
 Aim: Lift linear algebra container concept into the dec package. More...
 
struct  DGtal::concepts::CBidirectionalSegmentComputer< T >
 Aim: Defines the concept describing a bidirectional segment computer,. More...
 
struct  DGtal::concepts::CDynamicBidirectionalSegmentComputer< T >
 Aim: Defines the concept describing a dynamic and bidirectional segment computer, ie. a model of concepts::CSegment that can extend and retract itself in either direction. More...
 
struct  DGtal::concepts::CDynamicSegmentComputer< T >
 Aim: Defines the concept describing a dynamic segment computer,. More...
 
struct  DGtal::concepts::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::concepts::CIncrementalSegmentComputer< T >
 Aim: Defines the concept describing an incremental segment computer,. More...
 
struct  DGtal::concepts::CSegment< T >
 Aim: Defines the concept describing a segment, ie. a valid and not empty range. More...
 
struct  DGtal::concepts::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::concepts::CCurveLocalGeometricEstimator< 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::concepts::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::concepts::CLMSTDSSFilter< T >
 Aim: Defines the concept describing a functor which filters DSSes for L-MST calculations. More...
 
struct  DGtal::concepts::CLMSTTangentFromDSS< T >
 Aim: Defines the concept describing a functor which calculates a direction of the 2D DSS and an eccentricity [50] of a given point in this DSS. More...
 
struct  DGtal::concepts::CSegmentComputerEstimator< T >
 Aim: This concept is a refinement of CCurveLocalGeometricEstimator devoted to the estimation of a geometric quantiy along a segment detected by a segment computer. More...
 
struct  DGtal::concepts::C3DParametricCurve< T >
 Aim: More...
 
struct  DGtal::concepts::C3DParametricCurveDecorator< T >
 Aim: More...
 
struct  DGtal::concepts::CAdditivePrimitiveComputer< T >
 Aim: Defines the concept describing an object that computes some primitive from input points given group by group, while keeping some internal state. At any moment, the object is supposed to store at least one valid primitive for the formerly given input points. A primitive is an informal word that describes some family of objects that share common characteristics. Often, the primitives are geometric, e.g. digital planes. More...
 
struct  DGtal::concepts::CIncrementalPrimitiveComputer< T >
 Aim: Defines the concept describing an object that computes some primitive from input points given one at a time, while keeping some internal state. At any moment, the object is supposed to store at least one valid primitive for the formerly given input points. A primitive is an informal word that describes some family of objects that share common characteristics. Often, the primitives are geometric, e.g. digital planes. More...
 
struct  DGtal::concepts::CPrimitiveComputer< T >
 Aim: Defines the concept describing an object that computes some primitive from input points, while keeping some internal state. At any moment, the object is supposed to store at least one valid primitive for the formerly given input points. A primitive is an informal word that describes some family of objects that share common characteristics. Often, the primitives are geometric, e.g. digital planes. More...
 
struct  DGtal::deprecated::concepts::CConvolutionWeights< T >
 Aim: defines models of centered convolution kernel used for normal vector integration for instance. More...
 
struct  DGtal::concepts::CDigitalSurfaceLocalEstimator< T >
 Aim: This concept describes an object that can process a range over some generic digital surface so as to return one estimated quantity for each element of the range (or a given subrange). More...
 
struct  DGtal::concepts::CNormalVectorEstimator< T >
 Aim: Represents the concept of estimator of normal vector along digital surfaces. More...
 
struct  DGtal::concepts::CSurfelLocalEstimator< T >
 Aim: This concept describes an object that can process a range of surfels (that are supposed to belong to some (abstract) surface) so as to return one estimated quantity for each element of the range (or a given subrange). More...
 
struct  DGtal::concepts::CLocalEstimatorFromSurfelFunctor< T >
 Aim: this concept describes functors on digtal surface surfel which can be used to define local estimator using the adapter LocalEstimatorFromSurfelFunctorAdapter. More...
 
struct  DGtal::concepts::CPolarPointComparator2D< T >
 Aim: This concept gathers classes that are able to compare the position of two given points \( P, Q \) around a pole \( O \). More precisely, they compare the oriented angles lying between the horizontal line passing by \( O \) and the rays \( [OP) \) and \( [OQ) \) (in a counter-clockwise orientation). This is equivalent to compare the angle in radians from 0 (included) to 2 π (excluded). More...
 
struct  DGtal::C2x2DetComputer< T >
 Aim: This concept gathers all models that are able to compute the (sign of the) determinant of a 2x2 matrix with integral entries. More...
 
struct  DGtal::concepts::COrientationFunctor< T >
 Aim: This concept gathers models implementing an orientation test of \( k+1 \) points in a space of dimension \( n \). More...
 
struct  DGtal::concepts::COrientationFunctor2< T >
 Aim: This concept is a refinement of COrientationFunctor, useful for simple algebraic curves that can be uniquely defined by only two points. More...
 
struct  DGtal::concepts::CDigitalMetricSpace< T >
 Aim: defines the concept of digital metric spaces. More...
 
struct  DGtal::concepts::CMetricSpace< T >
 Aim: defines the concept of metric spaces. More...
 
struct  DGtal::concepts::CPowerMetric< T >
 Aim: defines the concept of special weighted metrics, so called power metrics. More...
 
struct  DGtal::concepts::CPowerSeparableMetric< T >
 Aim: defines the concept of separable metrics. More...
 
struct  DGtal::concepts::CSeparableMetric< T >
 Aim: defines the concept of separable metrics. More...
 
struct  DGtal::concepts::CGraphVisitor< T >
 Aim: Defines the concept of a visitor onto a graph, that is an object that traverses vertices of the graph according to some order. The user can either use the visitor as is, or even constrain the traversal with a given predicate. More...
 
struct  DGtal::concepts::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::concepts::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::concepts::CVertexMap< T >
 Aim: models of CVertexMap concept implement mapping between graph vertices and values. More...
 
struct  DGtal::concepts::CVertexPredicate< T >
 Aim: Defines a predicate on a vertex. More...
 
struct  DGtal::concepts::CConstImage< I >
 Aim: Defines the concept describing a read-only image, which is a refinement of CPointFunctor. More...
 
struct  DGtal::concepts::CImage< I >
 Aim: Defines the concept describing a read/write image, having an output iterator. More...
 
struct  DGtal::concepts::CImageCacheReadPolicy< T >
 Aim: Defines the concept describing a cache read policy. More...
 
struct  DGtal::concepts::CImageCacheWritePolicy< T >
 Aim: Defines the concept describing a cache write policy. More...
 
struct  DGtal::concepts::CImageFactory< T >
 Aim: Defines the concept describing an image factory. More...
 
struct  DGtal::concepts::CTrivialConstImage< I >
 Aim: Defines the concept describing a read-only image, which is a refinement of CPointFunctor. More...
 
struct  DGtal::concepts::CTrivialImage< I >
 Aim: Defines the concept describing an image without extra ranges, which is a refinement of CTrivialConstImage. More...
 
struct  DGtal::concepts::CDrawableWithBoard2D< T >
 Aim: The concept CDrawableWithBoard2D specifies what are the classes that admit an export with Board2D. More...
 
class  DGtal::concepts::Board3DTo2D< S, KS >
 Aim: The concept CDrawableWithBoard3DTo2D specifies what are the classes that admit an export with Board3DTo2D. More...
 
class  DGtal::concepts::Display3D< S, KS >
 Aim: The concept CDrawableWithDisplay3D specifies what are the classes that admit an export with Display3D. More...
 
struct  DGtal::concepts::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::concepts::CDrawableWithViewer3D< T, S, KS >
 Aim: The concept CDrawableWithViewer3D specifies what are the classes that admit an export with Viewer3D. More...
 
struct  DGtal::concepts::CBoundedNumber< T >
 Aim: The concept CBoundedNumber specifies what are the bounded numbers. Models of this concept should be listed in NumberTraits class and should have the isBounded property. More...
 
struct  DGtal::concepts::CCommutativeRing< T >
 Aim: Defines the mathematical concept equivalent to a unitary commutative ring. More...
 
struct  DGtal::concepts::CEuclideanRing< T >
 Aim: Defines the mathematical concept equivalent to a unitary commutative ring with a division operator. More...
 
struct  DGtal::concepts::CInteger< T >
 Aim: Concept checking for Integer Numbers. More precisely, this concept is a refinement of both CEuclideanRing and CIntegralNumber. More...
 
struct  DGtal::concepts::CIntegralNumber< T >
 Aim: Concept checking for Integral Numbers. Models of this concept should be listed in NumberTraits class and should have the isIntegral property. More...
 
struct  DGtal::concepts::CPointEmbedder< T >
 Aim: A point embedder is a mapping from digital points to Euclidean points. It adds inner types to functor. More...
 
struct  DGtal::concepts::CPointFunctor< T >
 Aim: Defines a functor on points. More...
 
struct  DGtal::concepts::CPointPredicate< T >
 Aim: Defines a predicate on a point. More...
 
struct  DGtal::concepts::CSignedNumber< T >
 Aim: Concept checking for Signed Numbers. Models of this concept should be listed in NumberTraits class and should have the isSigned property. More...
 
struct  DGtal::concepts::CSpace< T >
 Aim: Defines the concept describing a digital space, ie a cartesian product of integer lines. More...
 
struct  DGtal::concepts::CUnsignedNumber< T >
 Aim: Concept checking for Unsigned numbers. Models of this concept should be listed in NumberTraits class and should have the isUnsigned property. More...
 
struct  DGtal::concepts::CWithGradientMap< T >
 Aim: Such object provides a gradient map that associates to each argument some real vector. More...
 
struct  DGtal::concepts::CDigitalSet< T >
 Aim: Represents a set of points within the given domain. This set of points is modifiable by the user. It is thus very close to the STL concept of simple associative container (like set std::set<Point>), except that there is a notion of maximal set of points (the whole domain). More...
 
struct  DGtal::concepts::CBinner< T >
 Aim: Represents an object that places a quantity into a bin, i.e. a functor that associates a natural integer to a continuous value. More...
 
struct  DGtal::concepts::CDenseMatrix< T >
 Aim: Represent any dynamic or static sized matrix having dense representation. More...
 
struct  DGtal::concepts::CDenseVector< T >
 Aim: Represent any dynamic or static sized matrix having dense representation. More...
 
struct  DGtal::concepts::CDynamicMatrix< T >
 Aim: Represent any dynamic sized matrix having sparse or dense representation. More...
 
struct  DGtal::concepts::CDynamicVector< T >
 Aim: Represent any dynamic sized column vector having sparse or dense representation. More...
 
struct  DGtal::concepts::CLinearAlgebra< V, M >
 Aim: Check right multiplication between matrix and vector and internal matrix multiplication. Matrix and vector scalar types should be the same. More...
 
struct  DGtal::concepts::CLinearAlgebraSolver< S, V, M >
 Aim: Describe a linear solver defined over a linear algebra. Problems are of the form: More...
 
struct  DGtal::concepts::CMatrix< T >
 Aim: Represent any static or dynamic sized matrix having sparse or dense representation. More...
 
struct  DGtal::concepts::CSparseMatrix< T, TripletInterator >
 Aim: Represent any dynamic or static sized matrix having sparse representation. More...
 
struct  DGtal::concepts::CStaticMatrix< T >
 Aim: Represent any static sized matrix having sparse or dense representation. More...
 
struct  DGtal::concepts::CStaticVector< T >
 Aim: Represent any static sized column vector having sparse or dense representation. More...
 
struct  DGtal::concepts::CVector< T >
 Aim: Represent any static or dynamic sized column vector having sparse or dense representation. More...
 
struct  DGtal::concepts::CVectorSpace< T >
 Aim: Base concept for vector space structure. More...
 
struct  DGtal::concepts::CDigitalBoundedShape< TShape >
 Aim: designs the concept of bounded shapes in DGtal (shape for which upper and lower bounding bounds are available). More...
 
struct  DGtal::concepts::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::concepts::CEuclideanBoundedShape< TShape >
 
struct  DGtal::concepts::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::concepts::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::concepts::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::concepts::CAdjacency< Adj >
 Aim: The concept CAdjacency defines an elementary adjacency relation between points of a digital space. More...
 
struct  DGtal::concepts::CCellEmbedder< T >
 Aim: A cell embedder is a mapping from unsigned cells to Euclidean points. It adds inner types to functor. More...
 
struct  DGtal::concepts::CCellFunctor< T >
 Aim: Defines a functor on cells. More...
 
struct  DGtal::concepts::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::concepts::CDigitalSurfaceContainer< T >
 Aim: The digital surface container concept describes a minimal set of inner types and methods so as to describe the data of digital surfaces. More...
 
struct  DGtal::concepts::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::concepts::CDigitalSurfaceTracker< T >
 Aim: More...
 
struct  DGtal::concepts::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::concepts::CPreCellularGridSpaceND< T >
 Aim: This concept describes an unbounded 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::concepts::CSCellEmbedder< T >
 Aim: A cell embedder is a mapping from signed cells to Euclidean points. It adds inner types to functor. More...
 
struct  DGtal::concepts::CSurfelPredicate< T >
 Aim: Defines a predicate on a surfel. More...
 

Detailed Description