|
| using | Base = typename internal::BasketAggregate< P, NF, Ext0, Exts... >::type |
| | Base type, which aggregates all the computational objects using the CRTP.
|
| |
| using | Scalar = typename P::Scalar |
| | Scalar type used for computation, as defined from template parameter P
|
| |
| using | VectorType = typename P::VectorType |
| |
| using | DataPoint = P |
| | Point type used for computation.
|
| |
| using | NeighborFilter = NF |
| | Weighting function.
|
| |
| using | Base = internal::BasketAggregate< P, NF, Ext0, Exts... >::type |
| |
| using | Derived = Basket< P, NF, Ext0, Exts... > |
| | <
|
| |
| using | Scalar = typename Base::Scalar |
| | Alias to the Derived type.
|
| |
|
| bool | addNeighbor (const DataPoint &_nei) |
| | Add a neighbor to perform the fit.
|
| |
| VectorType | projectDescent (const VectorType &_q, int nbIter=16) const |
| | Project a point on the primitive using Gradient Descent This projection is realized by following the gradient of the primitive scalar field.
|
| |
| FIT_RESULT | compute (const IteratorBegin &begin, const IteratorEnd &end) |
| | Convenience function for STL-like iterators Add neighbors stored in a container using STL-like iterators, and call finalize at the end.
|
| |
| FIT_RESULT | computeWithIds (IndexRange ids, const PointContainer &points) |
| | Convenience function to iterate over a subset of samples in a PointContainer Add neighbors stored in a PointContainer and sampled using indices stored in ids.
|
| |
| FIT_RESULT | computeMLS (const PointContainer &points, const int mlsIter=5, const Scalar epsilon=Eigen::NumTraits< Scalar >::dummy_precision()) |
| |
| FIT_RESULT | computeWithIdsMLS (const IndexRange &ids, const PointContainer &points, const int mlsIter=5, const Scalar epsilon=Eigen::NumTraits< Scalar >::dummy_precision()) |
| |
| template<typename Container > |
| FIT_RESULT | compute (const Container &c) |
| | Convenience function for STL-like container.
|
| |
| template<typename IteratorBegin , typename IteratorEnd > |
| FIT_RESULT | compute (const IteratorBegin &, const IteratorEnd &) |
| | Convenience function for STL-like iterators.
|
| |
| template<typename IndexRange , typename PointContainer > |
| FIT_RESULT | computeWithIds (IndexRange, const PointContainer &) |
| | Convenience function to iterate over a subset of samples in a PointContainer.
|
| |
template<class P, class NF, template< class, class, typename > class Ext0, template< class, class, typename > class... Exts>
class Ponca::Basket< P, NF, Ext0, Exts >
Aggregator class used to declare specialized structures using CRTP.
Base ComputeObject for the Basket classes.
Implements the compute methods for fitting: compute, computeWithIds, ... Checkout Fitting Module: User Manual for more details
The various implementations of Ponca::Concept are mixed through specializations of the BasketDiff and Basket classes:
typedef
ComputationalDerivativesConcept1,
ComputationalDerivativesConcept2,
... ,
> myFitDer;
Aggregator class used to declare specialized structures with derivatives computations,...
DiffType
Flags defining which derivatives need to be computed.
- Template Parameters
-
| Derived | Derived class that provides the addNeighbor method (either Basket or BasketDiff) |
| Base | Base class that provides, through the CRTP the init, startNewPass, addNeighbor and finalize methods |
| P | Implements PointConcept |
| W | Implements WeightKernelConcept |
| Ext0 | Implements ComputationalObjectConcept |
| Exts | Implements ComputationalObjectConcept (optional) |
Definition at line 321 of file basket.h.
template<class P , class NF , template< class, class, typename > class Ext0, template< class, class, typename > class... Exts>
| using Ponca::Basket< P, NF, Ext0, Exts >::Base = typename internal::BasketAggregate<P, NF, Ext0, Exts...>::type |
Base type, which aggregates all the computational objects using the CRTP.
Definition at line 328 of file basket.h.
template<class P , class NF , template< class, class, typename > class Ext0, template< class, class, typename > class... Exts>
Point type used for computation.
Definition at line 333 of file basket.h.
template<class P , class NF , template< class, class, typename > class Ext0, template< class, class, typename > class... Exts>
| using Ponca::Basket< P, NF, Ext0, Exts >::Scalar = typename P::Scalar |
Scalar type used for computation, as defined from template parameter P
Definition at line 330 of file basket.h.
template<class P , class NF , template< class, class, typename > class Ext0, template< class, class, typename > class... Exts>
Add a neighbor to perform the fit.
When called directly, don't forget to call PrimitiveBase::startNewPass when starting multiple passes
- See also
- compute Prefer when using a range of Points
-
computeWithIds Prefer when using a range of ids
- Returns
- false if param nei is not a valid neighbor (weight = 0)
Definition at line 345 of file basket.h.
template<class P , class NF , template< class, class, typename > class Ext0, template< class, class, typename > class... Exts>
| VectorType Ponca::Basket< P, NF, Ext0, Exts >::projectDescent |
( |
const VectorType & |
_q, |
|
|
int |
nbIter = 16 |
|
) |
| const |
|
inline |
Project a point on the primitive using Gradient Descent This projection is realized by following the gradient of the primitive scalar field.
- Warning
- This function is in most cases slower than #project.
- Parameters
-
| _q | Starting point |
| nbIter | Number of iterations (default = 16) |
Definition at line 365 of file basket.h.