32#include "ConfigExamples.h"
33#include "DGtal/helpers/StdDefs.h"
34#include "DGtal/base/Common.h"
35#include "DGtal/geometry/surfaces/DigitalPlanePredicate.h"
36#include "DGtal/geometry/surfaces/estimation/PlaneProbingTetrahedronEstimator.h"
65 std::array<Point, 3> m = {
Point(1, 0, 0),
Point(0, 1, 0),
Point(0, 0, 1) };
71 while (estimator.
advance().first) {
76 if (state == Estimator::Neighborhood::HexagonState::Planar) {
77 std::cout <<
"Planar" << std::endl;
78 }
else if (state == Estimator::Neighborhood::HexagonState::Empty) {
79 std::cout <<
"Empty" << std::endl;
80 }
else if (state == Estimator::Neighborhood::HexagonState::NonPlanar) {
81 std::cout <<
"NonPlanar" << std::endl;
82 }
else if (state == Estimator::Neighborhood::HexagonState::NonConvex) {
83 std::cout <<
"NonConvex" << std::endl;
87 std::clog <<
"it = " << it <<
" "
88 << estimator.
m(0) <<
" " << estimator.
m(1) <<
" " << estimator.
m(2) <<
" "
Aim: Representing digital planes, which are digitizations of Euclidean planes, as point predicates.
Vector m(int aIndex) const
HexagonState hexagonState() const
bool advance(std::vector< PointOnProbingRay > const &aNeighbors)
Aim: A class that locally estimates a normal on a digital set using only a predicate "does a point x ...
PointVector< dim, Integer > Point
Points in DGtal::SpaceND.
PointVector< dim, Integer > Vector
Vectors in DGtal::SpaceND.
Point::Coordinate Integer
DGtal is the top-level namespace which contains all DGtal functions and types.
FreemanChain< int >::Vector Vector