35 #include "DGtal/base/Common.h"
38 #include "DGtal/shapes/implicit/ImplicitBall.h"
41 #include "DGtal/shapes/GaussDigitizer.h"
42 #include "DGtal/topology/LightImplicitDigitalSurface.h"
43 #include "DGtal/topology/DigitalSurface.h"
44 #include "DGtal/graph/DepthFirstVisitor.h"
45 #include "DGtal/graph/GraphVisitorRange.h"
48 #include "DGtal/geometry/surfaces/estimation/IIGeometricFunctors.h"
49 #include "DGtal/geometry/surfaces/estimation/IntegralInvariantCovarianceEstimator.h"
55 using namespace DGtal;
77 double realValue = 1.0/(radius * radius);
89 trace.
error() <<
"Problem with Khalimsky space" << std::endl;
101 VisitorRange range(
new Visitor( surf, *surf.
begin() ));
102 VisitorConstIterator ibegin = range.begin();
103 VisitorConstIterator iend = range.end();
105 MyIICurvatureFunctor curvatureFunctor;
106 curvatureFunctor.init( h, re );
108 MyIICurvatureEstimator curvatureEstimator( curvatureFunctor );
109 curvatureEstimator.attach(
K, dshape );
110 curvatureEstimator.setParams( re/h );
111 curvatureEstimator.init( h, ibegin, iend );
117 std::vector< Value > results;
118 std::back_insert_iterator< std::vector< Value > > resultsIt( results );
119 curvatureEstimator.eval( ibegin, iend, resultsIt );
123 trace.
beginBlock (
"Comparing results of integral invariant 3D Gaussian curvature ..." );
126 unsigned int rsize =
static_cast<unsigned int>(results.size());
130 trace.
error() <<
"ERROR: surface is empty" << std::endl;
135 for (
unsigned int i = 0; i < rsize; ++i )
137 mean += results[ i ];
143 trace.
error() <<
"ERROR: result is NaN" << std::endl;
148 double v = std::abs ( realValue - mean );
150 trace.
warning() <<
"True value: " << realValue << std::endl;
152 trace.
warning() <<
"Delta: " << delta <<
" |true - mean|: " << v << std::endl;
194 trace.
error() <<
"Problem with Khalimsky space" << std::endl;
206 VisitorRange range(
new Visitor( surf, *surf.
begin() ));
207 VisitorConstIterator ibegin = range.begin();
208 VisitorConstIterator iend = range.end();
210 MyIICurvatureFunctor curvatureFunctor;
211 curvatureFunctor.init( h, re );
212 MyIICurvatureEstimator curvatureEstimator( curvatureFunctor );
213 curvatureEstimator.attach(
K, dshape );
214 curvatureEstimator.setParams( re/h );
215 curvatureEstimator.init( h, ibegin, iend );
217 MyIICurvatureFunctorTensor curvatureFunctorTensor;
218 curvatureFunctorTensor.init( h, re );
219 MyIICurvatureEstimatorTensor curvatureEstimatorTensor( curvatureFunctorTensor );
220 curvatureEstimatorTensor.attach(
K, dshape );
221 curvatureEstimatorTensor.setParams( re/h );
222 curvatureEstimatorTensor.init( h, ibegin, iend );
228 std::vector< Value > results;
229 std::back_insert_iterator< std::vector< Value > > resultsIt( results );
230 curvatureEstimator.eval( ibegin, iend, resultsIt );
236 Value val = curvatureEstimator.eval( surf.
begin() );
237 ValueTensor valTensor = curvatureEstimatorTensor.eval( surf.
begin() );
238 bool ok = (val.first == std::get<0>(valTensor));
239 ok &= (val.second == std::get<1>(valTensor));
241 trace.
error()<<
"Error comparing principal curvatures between two different functors."<<std::endl;
246 trace.
beginBlock (
"Comparing results of integral invariant 3D Gaussian curvature ..." );
248 unsigned int error_order = 0;
249 unsigned int rsize =
static_cast<unsigned int>(results.size());
253 trace.
error() <<
"ERROR: surface is empty" << std::endl;
258 for (
unsigned int i = 0; i < rsize; ++i )
260 if( std::abs(results[i].first) < std::abs(results[i].second) )
266 trace.
warning() <<
"Error order: " << error_order << std::endl;
267 trace.
warning() <<
"If not equals to 0, something is wrong..." << std::endl;
271 if( error_order != 0 )
283 trace.
beginBlock (
"Testing class IntegralInvariantCovarianceEstimator and 3d functors" );
285 trace.
emphase() << ( res ?
"Passed." :
"Error." ) << std::endl;
Aim: This class is useful to perform a depth-first exploration of a graph given a starting point or s...
Aim: Represents a set of n-1-cells in a nD space, together with adjacency relation between these cell...
ConstIterator begin() const
Aim: A class for computing the Gauss digitization of some Euclidean shape, i.e. its intersection with...
const Point & getLowerBound() const
void attach(ConstAlias< EuclideanShape > shape)
const Point & getUpperBound() const
void init(const RealPoint &xLow, const RealPoint &xUp, typename RealVector::Component gridStep)
Aim: Transforms a graph visitor into a single pass input range.
Aim: model of CEuclideanOrientedShape and CEuclideanBoundedShape concepts to create a ball in nD....
Aim: model of CEuclideanOrientedShape concepts to create a shape from a polynomial.
Aim: This class implement an Integral Invariant estimator which computes for each surfel the covarian...
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 model of CDigitalSurfaceContainer which defines the digital surface as the boundary of an impl...
Aim: Implements basic operations that will be used in Point and Vector classes.
static SCell findABel(const KSpace &K, const PointPredicate &pp, unsigned int nbtries=1000)
Aim: Represent adjacencies between surfel elements, telling if it follows an interior to exterior ord...
void beginBlock(const std::string &keyword="")
Aim: A functor Matrix -> std::pair<RealVector,RealVector> that returns the first and the second princ...
DigitalSurface< MyDigitalSurfaceContainer > MyDigitalSurface
MyDigitalSurface::ConstIterator ConstIterator
BreadthFirstVisitor< MyDigitalSurface > Visitor
DGtal is the top-level namespace which contains all DGtal functions and types.
Represents a signed cell in a cellular grid space by its Khalimsky coordinates and a boolean value.
Aim: A functor Matrix -> Real that returns the Gaussian curvature by diagonalizing the given covarian...
Aim: A functor Matrix -> std::pair<Real,Real> that returns the first and the second principal curvatu...
bool testPrincipalCurvatures3d(double h)
bool testGaussianCurvature3d(double h, double delta)