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"
46 using namespace DGtal;
47 using namespace functors;
53 class testDigitalSetToCellularGridConverter
56 typedef map<Cell, CubicalCellData>
Map;
61 MyGaussDigitizer digShape;
63 testDigitalSetToCellularGridConverter () {}
66 MyEuclideanShape shape(
RealPoint( 0.0, 0.0 ), 16, 5, 5, M_PI_2/2. );
67 digShape.attach( shape );
68 digShape.init ( shape.getLowerBound(), shape.getUpperBound(), 1.0 );
69 Domain domainShape = digShape.getDomain();
85 testDigitalSetToCellularGridConverter
test;
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.
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.
Aim: A utility class for constructing different shapes (balls, diamonds, and others).
void beginBlock(const std::string &keyword="")
DGtal is the top-level namespace which contains all DGtal functions and types.
std::unordered_map< Cell, CubicalCellData > Map
CubicalComplex< KSpace, Map > CC
bool test(const I &itb, const I &ite)
PointVector< 3, double > RealPoint