DGtal  0.6.devel
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Groups Pages
testBinomialConvolver.cpp
1 
30 
31 #include <iostream>
32 #include "DGtal/base/Common.h"
33 #include "DGtal/kernel/PointVector.h"
34 #include "DGtal/geometry/curves/BinomialConvolver.h"
36 
37 using namespace std;
38 using namespace DGtal;
39 
41 // Functions for testing class Signal.
43 
47 bool testBinomialConvolver()
48 {
49  unsigned int nbok = 0;
50  unsigned int nb = 0;
51 
52  trace.beginBlock ( "Testing block ..." );
53  typedef PointVector<2, double> RealPoint;
54  std::vector< RealPoint > points;
55 #ifdef CPP11_INITIALIZER_LIST
56  points.push_back( RealPoint( { 0.0, 0.0 } ) );
57  points.push_back( RealPoint( { 1.0, 0.0 } ) );
58  points.push_back( RealPoint( { 2.0, 0.0 } ) );
59  points.push_back( RealPoint( { 2.0, 1.0 } ) );
60  points.push_back( RealPoint( { 2.0, 2.0 } ) );
61  points.push_back( RealPoint( { 1.0, 2.0 } ) );
62  points.push_back( RealPoint( { 0.0, 2.0 } ) );
63  points.push_back( RealPoint( { 0.0, 1.0 } ) );
64 #else
65  points.push_back( RealPoint( 0.0, 0.0 ) );
66  points.push_back( RealPoint( 1.0, 0.0 ) );
67  points.push_back( RealPoint( 2.0, 0.0 ) );
68  points.push_back( RealPoint( 2.0, 1.0 ) );
69  points.push_back( RealPoint( 2.0, 2.0 ) );
70  points.push_back( RealPoint( 1.0, 2.0 ) );
71  points.push_back( RealPoint( 0.0, 2.0 ) );
72  points.push_back( RealPoint( 0.0, 1.0 ) );
73 #endif
74 
75  typedef std::vector< RealPoint >::const_iterator ConstIteratorOnPoints;
76  typedef BinomialConvolver<ConstIteratorOnPoints, double> MyBinomialConvolver;
77 
78  for ( unsigned int n = 1; n < 10; ++n )
79  {
80  trace.info() << "Binomial convolver n=" << n << std::endl;
81  MyBinomialConvolver bcc( n );
82  bcc.init( 1.0, points.begin(), points.end(), true );
83  for ( unsigned int i = 0; i < 8; ++i )
84  std::cout << i
85  << " " << bcc.x( i ).first
86  << " " << bcc.x( i ).second
87  << " " << bcc.tangent( i ).first
88  << " " << bcc.tangent( i ).second
89  << " " << bcc.curvature( i )
90  << std::endl;
91  }
92  unsigned int n = MyBinomialConvolver::suggestedSize( 1.0, points.begin(), points.end() );
93  trace.info() << "Binomial convolver suggested n="
94  << n
95  << std::endl;
96 
98  TangentBCFct;
100  CurvatureBCFct;
103  tgtEstimator.init( 1.0, points.begin(), points.end(), true );
104  curvEstimator.init( 1.0, points.begin(), points.end(), true );
105  for ( ConstIteratorOnPoints it = points.begin(), it_end = points.end();
106  it != it_end; ++it )
107  {
108  std::cout << *it
109  << " " << tgtEstimator.eval( it )
110  << " " << curvEstimator.eval( it )
111  << std::endl;
112  }
113  nbok += true ? 1 : 0;
114  nb++;
115  trace.info() << "(" << nbok << "/" << nb << ") "
116  << "true == true" << std::endl;
117  trace.endBlock();
118 
119  return nbok == nb;
120 }
121 
123 // Standard services - public :
124 
125 int main( int argc, char** argv )
126 {
127  trace.beginBlock ( "Testing class BinomialConvolver" );
128  trace.info() << "Args:";
129  for ( int i = 0; i < argc; ++i )
130  trace.info() << " " << argv[ i ];
131  trace.info() << endl;
132 
133  bool res = testBinomialConvolver(); // && ... other tests
134  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
135  trace.endBlock();
136  return res ? 0 : 1;
137 }
138 // //