DGtal 1.4.0
Loading...
Searching...
No Matches
viewer3D-7bis-stdplane.cpp
Go to the documentation of this file.
1
50#include <cstdlib>
51#include <iostream>
52#include "DGtal/base/Common.h"
53#include "DGtal/helpers/StdDefs.h"
54#include "DGtal/geometry/surfaces/ChordGenericStandardPlaneComputer.h"
55#include "DGtal/io/viewers/Viewer3D.h"
57
58using namespace std;
59using namespace DGtal;
60
62// Standard services - public :
63
64/*
65 Displays in the \a viewer all the points in the \a domain that
66 satisfies the predicate \a pred.
67*/
68template <typename Viewer3D, typename Domain, typename Predicate>
69void
71 const Domain & domain, const Predicate & pred )
72{
73 for ( typename Domain::ConstIterator itB = domain.begin(), itE = domain.end();
74 itB != itE; ++itB )
75 {
76 if ( pred( *itB ) )
77 viewer << *itB;
78 }
79}
80/*
81 Displays in the \a viewer all the points in the range [it,itE).
82*/
83template <typename Viewer3D, typename InputIterator>
84void
85displayRange( Viewer3D & viewer, InputIterator it, InputIterator itE )
86{
87 for ( ; it != itE; ++it )
88 viewer << *it;
89}
90
91/*
92 Returns all the points in the \a domain that belongs to the standard
93 plane mu <= a*x+b*y+c*z < mu+|a|+|b|+|c|.
94*/
95template <typename Domain>
96std::vector<typename Domain::Point> pointsInStandardPlane
97( const Domain & domain,
98 typename Domain::Integer a,
99 typename Domain::Integer b,
100 typename Domain::Integer c,
101 typename Domain::Integer mu )
102{
103 typedef typename Domain::Integer Integer;
104 typedef typename Domain::Point Point;
105 typedef typename Domain::ConstIterator ConstIterator;
106 std::vector<Point> pts;
107 Integer mup = mu + abs(a) + abs(b) + abs(c);
108 for ( ConstIterator it = domain.begin(), itE = domain.end();
109 it != itE; ++it )
110 {
111 Point p = *it;
112 Integer r = a * p[ 0 ] + b * p[ 1 ] + c * p[ 2 ];
113 if ( ( mu <= r ) && ( r < mup ) )
114 pts.push_back( p );
115 }
116 return pts;
117}
118
119
120int main( int argc, char** argv )
121{
122 using namespace Z3i;
123 unsigned int nb = 0;
124 unsigned int nbok = 0;
125
126 QApplication application(argc,argv);
127
128 unsigned int diameter = argc > 1 ? atoi( argv[ 1 ] ) : 10;
129 int a = argc > 2 ? atoi( argv[ 2 ] ) : 2;
130 int b = argc > 3 ? atoi( argv[ 3 ] ) : 3;
131 int c = argc > 4 ? atoi( argv[ 4 ] ) : 5;
132 int mu = argc > 5 ? atoi( argv[ 5 ] ) : 0;
133 trace.beginBlock ( "Testing class ChordGenericStandardPlaneComputer" );
134 trace.info() << "Recognizing plane "
135 << mu << " <= " << a << " * x + "
136 << b << " * y + " << c << " * z < "
137 << (mu+abs(a)+abs(b)+abs(c)) << std::endl;
138 Domain domain1( Point( -diameter, -diameter, -diameter ),
139 Point( diameter, diameter, diameter ) );
140
141 typedef int64_t Integer;
143 typedef PlaneComputer::Primitive Primitive;
144 PlaneComputer plane;
145 plane.init( 1, 1 );
146
147 std::vector<Point> recognized = pointsInStandardPlane( domain1,
148 a, b , c, mu );
149 ++nb, nbok += plane.extend( recognized.begin(), recognized.end() ) ? 1 : 0;
150 trace.info() << "(" << nbok << "/" << nb
151 << ") All points are recognized." << std::endl;
152 trace.info() << " - Plane=" << plane
153 << std::endl;
154 Primitive strip = plane.primitive();
155 trace.info() << "strip=" << strip
156 << " axis=" << strip.mainAxis()
157 << " axiswidth=" << strip.axisWidth()
158 << " diag=" << strip.mainDiagonal()
159 << " diagwidth=" << strip.diagonalWidth()
160 << std::endl;
161 ++nb, nbok += ( strip.diagonalWidth() < sqrt(3.0) ) ? 1 : 0;
162 trace.info() << "(" << nbok << "/" << nb
163 << ") Diagonal width < sqrt(3)." << std::endl;
164 trace.emphase() << ( (nb == nbok) ? "Passed." : "Error." ) << endl;
165 trace.endBlock();
166
167 typedef Viewer3D<> MyViewer;
168 MyViewer viewer;
169 viewer.show();
170 Color red( 255, 0, 0 );
171 Color green( 0, 255, 0 );
172 Color grey( 200, 200, 200 );
173 Domain domain2( Point( -2*diameter, -2*diameter, -2*diameter ),
174 Point( 2*diameter, 2*diameter, 2*diameter ) );
175 viewer << CustomColors3D( red, red );
176 for ( std::vector<Point>::const_iterator it = recognized.begin(),
177 itE = recognized.end(); it != itE; ++it )
178 if ( ! strip( *it ) ) viewer << *it;
179 viewer << CustomColors3D( green, green );
180 displayRange( viewer, plane.begin(), plane.end() );
181 viewer << CustomColors3D( grey, grey );
182 displayPredicate( viewer, domain2, strip );
183 viewer << MyViewer::updateDisplay;
184 trace.info() << "- Points in green have been recognized as belonging to this standard plane." << std::endl;
185 trace.info() << "- Points in grey belongs also to the parallel strip of the recognized standard plane." << std::endl;
186 trace.info() << "- Points in red belongs to the parallel strip of the recognized standard plane but not to the input standard plane: NONE should be red." << std::endl;
187
188 return application.exec();
189}
190// //
Aim: A class that recognizes pieces of digital planes of given diagonal width. When the width is ,...
void init(InternalScalar widthNumerator=NumberTraits< InternalScalar >::ONE, InternalScalar widthDenominator=NumberTraits< InternalScalar >::ONE)
Structure representing an RGB triple with alpha component.
Definition Color.h:68
const ConstIterator & begin() const
const ConstIterator & end() const
void beginBlock(const std::string &keyword="")
std::ostream & emphase()
std::ostream & info()
double endBlock()
virtual void show()
Overload QWidget method in order to add a call to updateList() method (to ensure that the lists are w...
MyDigitalSurface::ConstIterator ConstIterator
DGtal is the top-level namespace which contains all DGtal functions and types.
boost::int64_t int64_t
signed 94-bit integer.
Definition BasicTypes.h:74
Trace trace
Definition Common.h:153
STL namespace.
int main()
Definition testBits.cpp:56
MyPointD Point
Domain domain
void displayRange(Viewer3D &viewer, InputIterator it, InputIterator itE)
std::vector< typename Domain::Point > pointsInStandardPlane(const Domain &domain, typename Domain::Integer a, typename Domain::Integer b, typename Domain::Integer c, typename Domain::Integer mu)
void displayPredicate(Viewer3D &viewer, const Domain &domain, const Predicate &pred)