| Cgr::BruteForceFunctor< _DummyPrimitive, _Point, _dim, _Scalar > | Extract pairs of points using brute force approach |
| Cgr::DummyPrimitive | |
| Cgr::DummyTransformVisitor | |
| Cgr::Functor4PCS< PointType, PairFilterFunctor, Options > | Processing functor for the computation of the 4PCS algorithm |
| Cgr::FunctorBrute4PCS< PointType, PairFilterFunctor, Options > | Processing functor for the computation of the 4PCS algorithm |
| Cgr::FunctorSuper4PCS< PointType, PointFilterFunctor, Options > | Processing functor for the computation of the Super4PCS algorithm |
| Cgr::HyperSphere< Point, _dim, Scalar > | |
| Cgr::IndexedNormalHealSet | Work only in 3D, based on healpix |
| Cgr::IndexedNormalSet< Point, dim, _ngSize, _Scalar > | Normal set indexed by a position in euclidean space |
| Cgr::IntersectionFunctor< _Primitive, _Point, _dim, _Scalar > | Extract pairs of points by rasterizing primitives and collect points |
| Cgr::KdTree< _Scalar, _Index >::KdNode | |
| Cgr::KdTree< _Scalar, _Index > | 3D Kdtree with reentrant queries |
| Cgr::KdTree< Scalar > | |
| Cgr::Utils::LCPMetric< Scalar > | Implementation of the Largest Common PointSet metric |
| Cgr::Utils::Logger | |
| Cgr::MatchBase< PointType, _TransformVisitor, OptExts > | Abstract class for registration algorithms |
| ▼Cgr::MatchBase< _PointType, _TransformVisitor, OptExts..., CongruentSetExplorationOptions > | |
| Cgr::CongruentSetExplorationBase< _Traits, _PointType, _TransformVisitor, _PairFilteringFunctor, OptExts > | Base class for Congruent Sec Exploration algorithms |
| ▼Cgr::MatchBase< _PointType, _TransformVisitor, PairFilteringOptions..., CongruentSetExplorationOptions > | |
| ▼Cgr::CongruentSetExplorationBase< Traits3pcs< MatchBase< _PointType, _TransformVisitor, PairFilteringOptions, CongruentSetExplorationOptions >::PosMutablePoint >, _PointType, _TransformVisitor, _PairFilteringFunctor, PairFilteringOptions > | |
| Cgr::Match3pcs< _PointType, _TransformVisitor, _PairFilteringFunctor, PairFilteringOptions > | Class for the computation of the 3PCS algorithm |
| ▼Cgr::CongruentSetExplorationBase< Traits4pcs< MatchBase< _PointType, _TransformVisitor, PairFilteringOptions, CongruentSetExplorationOptions >::PosMutablePoint >, _PointType, _TransformVisitor, _PairFilteringFunctor, PairFilteringOptions > | |
| Cgr::Match4pcsBase< _Functor, _PointType, _TransformVisitor, _PairFilteringFunctor, PairFilteringOptions > | Class for the computation of the 4PCS algorithm |
| Cgr::NdNode< Point, _dim, Scalar, _PointContainer, _IdContainer > | Multidimensional node used for intersection query |
| Cgr::Utils::OneRingNeighborhood::NeighborhoodType< dim > | Helper class |
| Cgr::Utils::OneRingNeighborhood | Compute the 3^dim neighborhood for a cell This implementation is not efficient and must be improved e.g., do no allocate any array, just call a function with the ids |
| Cgr::PairCreationFunctor< PointType, _Scalar, FilterFunctor, Options > | |
| Cgr::PairCreationFunctor< PointType, Scalar, PointFilterFunctor, OptionType > | |
| ▼Cgr::PairFilterConcept | |
| Cgr::AdaptivePointFilter | Functor used in n-pcs algorithm to filters pairs of points according to the exploration basis. Uses normal, colors and max motion when available |
| Cgr::DummyPointFilter | Functor used in n-pcs algorithm to filters pairs of points according to the exploration basis, |
| ▼Cgr::PointConcept | |
| Cgr::Point3D< _Scalar > | The basic 3D point structure. A point potentially contains also directional information and color |
| Cgr::Point3D< _Scalar > | The basic 3D point structure. A point potentially contains also directional information and color |
| Cgr::KdTree< _Scalar, _Index >::QueryNode | Element of the stack |
| Cgr::KdTree< _Scalar, _Index >::RangeQuery< _stackSize > | |
| ▼Cgr::SamplerConcept< PointType > | |
| Cgr::UniformDistSampler< PointType > | |
| ▼CTBase | |
| Cgr::AdaptivePointFilter::Options< Derived, TBase > | |
| Cgr::CongruentSetExplorationOptions< Derived, TBase > | |
| Cgr::DummyPointFilter::Options< Derived, TBase > | |
| Cgr::MatchBase< PointType, _TransformVisitor, OptExts >::Options< Derived, TBase > | |
| Cgr::PairFilterConcept::Options< Derived, TBase > | |
| Cgr::Utils::Timer | |
| Cgr::Traits3pcs< PointType > | |
| Cgr::Traits4pcs< PointType > | |
| ▼Ctype | |
| Cgr::Utils::CRTP< OptExts..., Options > | |
| Cgr::Utils::CRTP< OptExts......, Options > | |
| Cgr::Utils::CRTP< PairFilteringOptions......, Options > | |
| Cgr::Utils::CRTP< Bases > | CRTP class designed by Gael Guennebaud Source: http://disq.us/p/1tf4a7l https://www.onlinegdb.com/rJEhwUc-m |
| Cgr::Utils::WeightedLCPMetric< Scalar > | Implementation of a weighted variant of the Largest Common PointSet metric |
| CAlignedBox< Scalar, 3 > | |
| CIndex | |
| Cint | |
| CKdNode | |
| ▼CPointType | |
| Cgr::MatchBase< PointType, _TransformVisitor, OptExts >::PosMutablePoint | A convenience class used to wrap (any) PointType to allow mutation of position of point samples for internal computations |
| CScalar | |
| Cstatic constexpr int | |
| Cunsigned int | |
| CVectorType | |
| CVectorType | |
