33#include "DGtal/base/Common.h"
34#include "ConfigTest.h"
35#include "DGtal/helpers/StdDefs.h"
37#include "DGtal/topology/CubicalComplex.h"
39#include "DGtal/shapes/GaussDigitizer.h"
40#include "DGtal/shapes/Shapes.h"
41#include "DGtal/shapes/EuclideanShapesDecorator.h"
42#include "DGtal/shapes/parametric/Flower2D.h"
47using namespace functors;
56 typedef map<Cell, CubicalCellData>
Map;
68 digShape.
init ( shape.getLowerBound(), shape.getUpperBound(), 1.0 );
88 res &=
test.extractCells();
90 trace.
emphase() << ( res ?
"Passed." :
"Error." ) << endl;
Aim: This class represents an arbitrary cubical complex living in some Khalimsky space....
Aim: A wrapper class around a STL associative container for storing sets of digital points within som...
Aim: Model of the concept StarShaped represents any flower with k-petals in the plane.
void attach(ConstAlias< EuclideanShape > shape)
void init(const RealPoint &xLow, const RealPoint &xUp, typename RealVector::Component gridStep)
const Point & lowerBound() const
const Point & upperBound() const
Aim: This class is a model of CCellularGridSpaceND. It represents the cubical grid as a cell complex,...
bool init(const Point &lower, const Point &upper, bool isClosed)
Specifies the upper and lower bounds for the maximal cells in this space.
static void digitalShaper(TDigitalSet &aSet, const TShapeFunctor &aFunctor)
void beginBlock(const std::string &keyword="")
MyGaussDigitizer digShape
CubicalComplex< KSpace, Map > CC
map< Cell, CubicalCellData > Map
GaussDigitizer< Space, MyEuclideanShape > MyGaussDigitizer
testDigitalSetToCellularGridConverter()
Flower2D< Space > MyEuclideanShape
Space::RealPoint RealPoint
DGtal is the top-level namespace which contains all DGtal functions and types.
bool test(const I &itb, const I &ite)