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.
Description of concept 'CAdditivePrimitiveComputer'
Associated types :
- Primitive, the type that defines the primitive.
- Point: the type of the input points.
Valid expressions and semantics
|Name ||Expression ||Type requirements ||Return type ||Precondition ||Semantics ||Post condition ||Complexity |
|insert new points||x.extend(it, itE)||ForwardIterator it, itE: the type of iterator on points, a model of boost::ForwardIterator on Point ||bool ||tries to find a primitive that matches the new points in range [it, itE) and all formerly given input points, return true on success (state may change), false otherwise (state is unchanged)|
|check new points||x.isExtendable(it, itE)||ForwardIterator it, itE: the type of iterator on points, a model of boost::ForwardIterator ||bool ||tries to find a primitive that matches the new points in range [it, itE) and all formerly given input points, return true only if it possible, the state is always unchanged|
- Template Parameters
Definition at line 99 of file CAdditivePrimitiveComputer.h.