DGtal 0.3.0

Data Structures

Here are the data structures with brief descriptions:
DGtal::AbsFunctor< T >
DGtal::AdapterDSS< TIterator, TInteger, connectivity >
DGtal::AdapterDSS4ConcavePart< TIterator, TInteger, connectivity >
DGtal::AdapterDSS4ConvexPart< TIterator, TInteger, connectivity >
DGtal::AndBoolFct2
DGtal::KhalimskySpaceND< dim, TInteger >::AnyCellCollection< CellType >
DGtal::ArithmeticalDSS< TIterator, TInteger, connectivity >Aim: Dynamic recognition of a digital straight segment (DSS) defined as the sequence of simply connected points (x,y) such that mu <= ax - by < mu + omega. (see Debled and Reveilles [1995]). This class is a model of the concept CSegmentComputer
DGtal::BinaryPointPredicate< TPointPredicate1, TPointPredicate2 >Aim: The predicate returns true when the point is within the given bounds
DGtal::Bits
DGtal::CAdjacency< Adj >Aim: The concept CAdjacency defines an elementary adjacency relation between points of a digital space
DGtal::CBoundedDomain< T >Aim: This concept represents a bounded digital domain, i.e. a non mutable subset of points of the given digital space
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
DGtal::CDigitalSet< Domain >
DGtal::CDomain< T >Aim: This concept represents a digital domain, i.e. a non mutable subset of points of the given digital space
DGtal::CDomainAdjacency< T >Aim: Refines the concept CAdjacency by telling that the adjacency is specific to a given domain of the embedding digital space
DGtal::CDrawableWithDGtalBoard< T >
DGtal::CDrawableWithDGtalQGLViewer< T >
DGtal::CellDirectionIterator< dim, TInteger >
DGtal::CImageContainer< ImageContainer >
DGtal::CImplicitShape< TShape >
DGtal::CInteger< T >Aim: The concept CInteger specifies what are the usual integer numbers, more precisely the ones that are representable on a computer
DGtal::ClippingPlane
DGtal::DGtalQGLViewer::clippingPlaneGL
DGtal::Clock
DGtal::ColorBrightnessColorMap< PValue, PDefaultColor >Aim: This class template may be used to (linearly) convert scalar values in a given range into a color with given lightness
DGtal::Common
DGtal::DGtalQGLViewer::compFarthestFromCamera
DGtal::ConceptUtilsAim: This utility class gathers several static methods useful for concept checks
DGtal::ConstantPointPredicate< TPoint, boolCst >Aim: The predicate that returns always the same value boolCst
DGtal::FreemanChain< TInteger >::ConstIterator
DGtal::GreedyDecomposition< TSegment >::ConstIterator
DGtal::MaximalSegments< TSegment >::ConstIterator
DGtal::HyperRectDomain< TSpace >::ConstRangeAim: range through all the points in the domain. Defines a constructor taking a domain in parameter, begin and end methods returning ConstIterator, and rbegin and rend methods returning ReverseConstIterator
DGtal::HyperRectDomain< TSpace >::ConstSubRangeAim: range through some subdomain of all the points in the domain. Defines a constructor taking a domain in parameter plus some additional parameters to specify the subdomain, begin and end methods returning ConstIterator, and rbegin and rend methods returning ReverseConstIterator
DGtal::CountedPtr< T >Aim: Smart pointer based on reference counts
DGtal::CountedPtr< T >::counter
DGtal::CowPtr< T >Aim: Copy on write shared pointer
DGtal::CPointPredicate< T >Aim: Defines a predicate on a point
DGtal::CSeparableMetric< T >
DGtal::CSignedInteger< T >
DGtal::CSpace< T >Aim: Defines the concept describing a digital space, ie a cartesian product of integer lines
DGtal::CUnsignedInteger< T >
DGtal::CustomColors
DGtal::CustomColors3D
DGtal::CustomFillColor
DGtal::CustomPen
DGtal::CustomPenColor
DGtal::CustomStyle
DGtal::CustomStyle3D
DGtal::CValue< T >
DGtal::FP< TIterator, TInteger, connectivity >::DefaultDrawStyle
DGtal::FreemanChain< TInteger >::DefaultDrawStyle
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::DefaultDrawStyle
DGtal::ImageContainerBySTLVector< TDomain, TValue >::DefaultDrawStyle
DGtal::DigitalSetBySTLSet< TDomain >::DefaultDrawStyle
DGtal::DigitalSetBySTLVector< TDomain >::DefaultDrawStyle
DGtal::Object< TDigitalTopology, TDigitalSet >::DefaultDrawStyle
DGtal::ArithmeticalDSS< TIterator, TInteger, connectivity >::DefaultDrawStyleBB
DGtal::HyperRectDomain< TSpace >::DefaultDrawStyleGrid
DGtal::PointVector< dim, Integer >::DefaultDrawStyleGrid
DGtal::HyperRectDomain< TSpace >::DefaultDrawStylePaving
DGtal::PointVector< dim, Integer >::DefaultDrawStylePaving
DGtal::ArithmeticalDSS< TIterator, TInteger, connectivity >::DefaultDrawStylePoints
DGtal::DistanceTransformation< Image, p, IntegerLong >::DefaultForegroundPredicate
DGtal::DGtalBoardAim: This class specializes a 'Board' class so as to display DGtal objects more naturally (with <<). The user has simply to declare a DGtalBoard object and uses stream operators to display most digital objects. Furthermore, one can use this class to modify the current style for drawing
DGtal::DGtalInventor< TSpace >Aim: A stream object based on Open Inventor for exporting or displaying DGtal objects
DGtal::DGtalQGLViewerAim:
DGtal::DigitalSetBySTLSet< TDomain >Aim:
DGtal::DigitalSetBySTLVector< TDomain >Aim: Realizes the concept CDigitalSet by using the STL container std::vector
DGtal::DigitalSetConverter< OutputDigitalSet >Aim: Utility class to convert between types of sets
DGtal::DigitalSetDomain< TDigitalSet >Aim: Constructs a domain limited to the given digital set
DGtal::DigitalSetSelector< Domain, Preferences >Aim: Automatically defines an adequate digital set type according to the hints given by the user
DGtal::DigitalTopology< TForegroundAdjacency, TBackgroundAdjacency >Aim: Represents a digital topology as a couple of adjacency relations
DGtal::DistanceTransformation< Image, p, IntegerLong >Aim: Implementation of the linear in time distance transformation
DGtal::DistanceValueTraits< Integer, p >Aim:
DGtal::DomainAdjacency< TDomain, TAdjacency >Aim: Given a domain and an adjacency, limits the given adjacency to the specified domain for all adjacency and neighborhood computations
DGtal::deprecated::DomainMetricAdjacency< Domain, maxNorm1, dimension >Aim: Describes digital adjacencies in a digital domain that are defined with the 1-norm and the infinity-norm
DGtal::DomainPredicate< TDomain >Aim: The predicate returning true iff the point is in the domain given at construction. It is just a wrapper class around the methods Domain::isInside( const Point & ), where Domain stands for any model of CDomain
DGtal::DrawableWithDGtalBoard
DGtal::DrawDomainGrid
DGtal::DrawDomainPaving
DGtal::DrawDSSBoundingBox
DGtal::DrawDSSPoints
DGtal::DrawGridPixel
DGtal::DrawObjectAdjacencies
DGtal::DrawPavingPixel
DGtal::DrawWithBoardModifier
DGtal::DrawWithQGLViewerModifier
DGtal::Expander< TObject >Aim: This class is useful to visit an object by adjacencies, layer by layer
DGtal::FalseBoolFct0
DGtal::FalsePointPredicate< TPoint >Aim: The predicate that returns always false
DGtal::FP< TIterator, TInteger, connectivity >Aim:Computes the faithful polygon (FP) of a digital curve
DGtal::FreemanChain< TInteger >
DGtal::GradientColorMap< PValue, PDefaultPreset, PDefaultFirstColor, PDefaultLastColor >Aim: This class template may be used to (linearly) convert scalar values in a given range into a color in a gradient defined by two or more colors
DGtal::GrayscaleColorMap< PValue >Aim: This class template may be used to (linearly) convert scalar values in a given range into gray levels
DGtal::GreedyDecomposition< TSegment >Aim: Computes the greedy decomposition of a sequence into segments (the last element of a given segment is the first one one of the next segment). This class is a model of CDecomposition
DGtal::VolReader< TImageContainer >::HeaderField
DGtal::HueShadeColorMap< PValue, DefaultCycles >Aim: This class template may be used to (linearly) convert scalar values in a given range into a color in a cyclic hue shade colormap, maybe aka rainbow color map. This color map is suitable, for example, to colorize distance functions. By default, only one hue cycle is used
DGtal::HyperRectDomain< TSpace >Aim: Parallelepidec region of a digital space, model of a 'CDomain'
DGtal::HyperRectDomain_Iterator< TPoint >
DGtal::HyperRectDomain_subIterator< TPoint >
DGtal::IdentityBoolFct1
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >Model of CImageContainer implementing the association key<->Value using a hash tree. This class provides a built-in iterator
DGtal::experimental::ImageContainerByITKImage< TDomain, TValue >Aim: implements a model of CImageContainer using a ITK Image
DGtal::ImageContainerBySTLMap< Domain, Value >
DGtal::ImageContainerBySTLVector< TDomain, TValue >
DGtal::ImageFromSet< TImage >Aim: Define utilities to convert a digital set into an image
DGtal::ImageSelector< Domain, Value, Preferences >Aim: Automatically defines an adequate image type according to the hints given by the user
DGtal::ImplicitBall< TSpace >Aim: model of CImplicitShape concept to create a ball in nD.
DGtal::ImplicitHyperCube< TSpace >Aim: model of CImplicitShape concept to create an hypercube in nD.
DGtal::ImplicitNorm1Ball< TSpace >Aim: model of CImplicitShape concept to create a ball for the L_1 norm in nD.
DGtal::ImplicitRoundedHyperCube< TSpace >Aim: model of CImplicitShape concept to create a rounded hypercube in nD.
DGtal::ImpliesBoolFct2
DGtal::InputException
DGtal::IntegerTraits< T >Aim: The traits class for all models of Cinteger
DGtal::IntegerTraits< int16_t >
DGtal::IntegerTraits< int32_t >
DGtal::IntegerTraits< int64_t >
DGtal::IntegerTraits< int8_t >
DGtal::IntegerTraits< uint16_t >
DGtal::IntegerTraits< uint32_t >
DGtal::IntegerTraits< uint64_t >
DGtal::IntegerTraits< uint8_t >
DGtal::IOException
DGtal::IsLowerPointPredicate< TPoint >Aim: The predicate returns true when the point is below (or equal) the given upper bound
DGtal::IsUpperPointPredicate< TPoint >Aim: The predicate returns true when the point is above (or equal) the given lower bound
DGtal::IsWithinPointPredicate< TPoint >Aim: The predicate returns true when the point is within the given bounds
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Iterator
DGtal::IVViewerAim: A facade to represent an inventor window for 3D objects. May be a SoXt or a SoQt examiner viewer. NB: backported from ImaGeneUtils library
DGtal::KhalimskyCell< dim, TInteger >
DGtal::KhalimskySpaceND< dim, TInteger >Aim: This class is a model of CCellularGridSpaceND. It represents the cubical grid as a cell complex, whose cells are defined as an array of integers. The topology of the cells is defined by the parity of the coordinates (even: closed, odd: open)
DGtal::Lattice< TSpace >Aim: Represents an n-dimensional integer lattice in an m-dimensional real vector space
DGtal::LinearAlgebra< Space >Aim:
DGtal::DGtalQGLViewer::lineGL
DGtal::LOG2< X >
DGtal::LOG2< 1 >
DGtal::LOG2< 2 >
DGtal::MagickReader< TImageContainer >Aim: implements methods to read a 2D image using the ImageMagick library
DGtal::Matrix
DGtal::MaxFunctor< T >
DGtal::MaximalSegments< TSegment >Aim: Computes the set of maximal segments of a sequence. Maximal segments are segments that cannot be included in other segments. This class is a model of CDecomposition
DGtal::MeasureOfStraightLines
DGtal::MemoryException
DGtal::MetricAdjacency< TSpace, maxNorm1, dimension >Aim: Describes digital adjacencies in digital spaces that are defined with the 1-norm and the infinity-norm
DGtal::MinFunctor< T >
DGtal::MinusFunctor< T >
DGtal::ModuloComputer< TInteger >Implements basic functions on modular arithmetic
DGtal::Morton< THashKey, TPoint >Aim:
MyDomainStyleCustomRed
MyDrawStyleCustomBlue
MyDrawStyleCustomFillColor
MyDrawStyleCustomGreen
MyDrawStyleCustomRed
MyObjectStyleCustom
MyObjectStyleCustomRed
myreverse_iterator< _Iterator >
MyStyleCustom
MyStyleCustomRed
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::Node
ImageContainerByHashTree::Node
DGtal::NotBoolFct1
DGtal::NotPointPredicate< TPointPredicate >Aim: The predicate returns true when the point is within the given bounds
DGtal::Object< TDigitalTopology, TDigitalSet >Aim: An object (or digital object) represents a set in some digital space associated with a digital topology
DGtal::OpInSTLContainers< Container, Iterator >
DGtal::OpInSTLContainers< Container, std::reverse_iterator< typename Container::iterator > >
DGtal::OrBoolFct2
DGtal::OrderedAlphabetAim: Describes an alphabet over an interval of (ascii) letters, where the lexicographic order can be changed (shifted, reversed, ...). Useful for the arithmetic minimum length polygon (AMLP)
DGtal::PNMWriter< TImage, TColormap >Aim: Export a 2D and a 3D Image using the Netpbm formats (ASCII mode).

  • PPM: RGB
  • PGM: grayscale
  • PPM3D: 3D variant of PPM
  • PGM3D: 3D variant of PGM
DGtal::Point2ShapePredicate< Shape, isUpward, isClosed >Aim: Predicate returning true iff the point is in the 'interior' of the shape following the concept of CPointPredicate
DGtal::Point2ShapePredicateComparator< T, b1, b2 >
DGtal::Point2ShapePredicateComparator< T, false, false >
DGtal::Point2ShapePredicateComparator< T, false, true >
DGtal::Point2ShapePredicateComparator< T, true, false >
DGtal::Point2ShapePredicateComparator< T, true, true >
DGtal::DGtalQGLViewer::pointGL
DGtal::PointListReader< TPoint >Aim: Implements method to read a set of points represented in each line of a file
DGtal::PointVector< dim, Integer >Aim: Implements basic operations that will be used in Point and Vector classes
DGtal::POW< X, exponent >
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::POW< X, exponent >
DGtal::experimental::ImageContainerByHashTree< TDomain, TValue, THashKey >::POW< X, 1 >
DGtal::POW< X, 1 >
DGtal::Preimage2D< Shape >Aim: Computes the preimage of the 2D Euclidean shapes crossing a sequence of straigth segments in linear-time according to the algorithm of O'Rourke (1981)
DGtal::promote_trait< A, B >
DGtal::promote_trait< int32_t, int64_t >
DGtal::DGtalQGLViewer::quadGL
DGtal::RawReader< TImageContainer >Aim: implements methods to read a "Vol" file format
DGtal::RawWriter< TImage, TColormap >Aim: Raw binary export of an Image
DGtal::ReverseDistanceTransformation< Image, p, IntegerShort >Aim: Implementation of the linear in time reverse distance transformation
DGtal::StraightLine< TInteger >::selfDrawStyle
DGtal::FreemanChain< TInteger >::SelfDrawStyle
DGtal::Preimage2D< Shape >::selfDrawStyle
DGtal::DigitalSetBySTLVector< TDomain >::SelfDrawStyle
DGtal::SeparableMetricTraits< TAbscissa, TInternalValue, tp >Aim: Implements basic functions associated to metrics used by separable volumetric algorithms
DGtal::SeparableMetricTraits< TAbscissa, TInternalValue, 0 >
DGtal::SeparableMetricTraits< TAbscissa, TInternalValue, 1 >
DGtal::SeparableMetricTraits< TAbscissa, TInternalValue, 2 >
DGtal::SetFromImage< TSet >Aim: Define utilities to convert a digital set into an image
DGtal::SetMode
DGtal::SetMode3D
DGtal::SetPredicate< TDigitalSet >Aim: The predicate returning true iff the point is in the domain given at construction
DGtal::Shapes< TDomain >Aim: A utility class for constructing different shapes (balls, diamonds, and others)
DGtal::SignedKhalimskyCell< dim, TInteger >
DGtal::SimpleForegroundPredicate< Image >Aim: Define a simple Foreground predicate thresholding image values between to constant values
DGtal::SpaceND< dim, TInteger >
DGtal::ImageContainerBySTLVector< TDomain, TValue >::SpanIterator
DGtal::ImageContainerBySTLMap< Domain, Value >::SpanIterator
DGtal::StdDefsAim: For now, useless
DGtal::StraightLine< TInteger >Aim: Represents a StraightLine uniquely defined by two 2D points and that is able to return for each 2D point of the domain its signed distance to itself
DGtal::SpaceND< dim, TInteger >::Subcospace< codimension >Define the type of a sub co-Space
DGtal::SpaceND< dim, TInteger >::Subspace< subdimension >Define the type of a subspace
DGtal::Surfaces< TKSpace >Aim: A utility class for constructing surfaces (i.e. set of (n-1)-cells)
DGtal::SurfelAdjacency< dim >Aim: Represent adjacencies between surfel elements, telling if it follows an interior to exterior ordering or exterior to interior ordering. It allows tracking of boundaries and of surfaces
DGtal::SurfelNeighborhood< TKSpace >Aim: This helper class is useful to compute the neighboring surfels of a given surfel, especially over a digital surface or over an object boundary. Two signed surfels are incident if they share a common n-2 cell. This class uses a SurfelAdjacency so as to determine adjacent surfels (either looking for them from interior to exterior or inversely)
DGtal::TagFalse
DGtal::TagTrue
DGtal::TagUnknown
DGtal::ArithmeticalDSS< TIterator, TInteger, connectivity >::Tools< TInt, c >
DGtal::ArithmeticalDSS< TIterator, TInteger, connectivity >::Tools< TInt, 4 >
DGtal::Trace
DGtal::TraceWriter
DGtal::TraceWriterFile
DGtal::TraceWriterTerm
DGtal::TrueBoolFct0
DGtal::TruePointPredicate< TPoint >Aim: The predicate that returns always true
vector
DGtal::VolReader< TImageContainer >Aim: implements methods to read a "Vol" file format
DGtal::VolWriter< TImage, TColormap >Aim: Export a 3D Image using the Vol formats
DGtal::DGtalQGLViewer::voxelGL
DGtal::Warning_promote_trait_not_specialized_for_this_case
DGtal::XorBoolFct2
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines