DGtal  1.0.0
Functions
testArithmeticalDSSConvexHull.cpp File Reference
#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/geometry/curves/ArithmeticalDSL.h"
#include "DGtal/geometry/curves/ArithmeticalDSSConvexHull.h"
#include "DGtal/geometry/curves/ArithmeticalDSS.h"
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/kernel/NumberTraits.h"
#include "DGtal/arithmetic/LatticePolytope2D.h"
Include dependency graph for testArithmeticalDSSConvexHull.cpp:

Go to the source code of this file.

Functions

template<typename DSL >
bool basicTest (const DSL &aDSL)
 
template<typename DSL >
bool basicTest (typename DSL::Coordinate a, typename DSL::Coordinate b)
 
bool testWithoutLengthConstraint ()
 
template<typename DSL >
bool comparisonLeftHull (typename DSL::Coordinate a, typename DSL::Coordinate b)
 
bool testWithLengthConstraint ()
 
template<typename DSL >
DSL smartCHSubsegment (const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)
 
template<typename DSL >
DSL trivialSubsegment (const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)
 
template<typename DSL >
bool comparisonSubsegment (const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)
 
template<typename DSL >
bool comparisonSubsegment (typename DSL::Coordinate a, typename DSL::Coordinate b)
 
bool testSubsegment ()
 
template<typename DSL >
bool basicTest2 (const DSL &aDSL)
 
template<typename DSL >
bool basicTest2 (typename DSL::Coordinate a, typename DSL::Coordinate b)
 
bool testWithoutLengthConstraint2 ()
 
template<typename DSS >
DSS::DSL reversedSmartCHSubsegment (const DSS &aDSS, typename DSS::Position aBound)
 
template<typename DSS >
bool comparisonSubsegment2 (const DSS &aDSS, typename DSS::Position aBound)
 
template<typename DSL >
bool comparisonSubsegment2 (typename DSL::Coordinate a, typename DSL::Coordinate b)
 
bool testSubsegment2 ()
 
int main (int argc, char **argv)
 

Detailed Description

This program is free software: you can redistribute it and/or modify it under the terms of the GNU Lesser General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.

This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.

You should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/.

Author
Tristan Roussillon (trist.nosp@m.an.r.nosp@m.oussi.nosp@m.llon.nosp@m.@liri.nosp@m.s.cn.nosp@m.rs.fr ) Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), CNRS, France
Date
2014/02/11

Functions for testing class ArithmeticalDSSConvexHull.

This file is part of the DGtal library.

Definition in file testArithmeticalDSSConvexHull.cpp.

Function Documentation

◆ basicTest() [1/2]

template<typename DSL >
bool basicTest ( const DSL &  aDSL)

Applies smartCH on a segment starting from (0,0) and contained in a given arithmetical DSL

Parameters
aDSLany DSL
Returns
'true' if the algorithm returns correct values, 'false' otherwise
Template Parameters
DSLan arithmeticalDSS type (either naive or standard)

Definition at line 61 of file testArithmeticalDSSConvexHull.cpp.

62 {
63  typedef typename DSL::Point Point;
64  typedef typename DSL::Vector Vector;
65  typedef typename DSL::Integer Integer;
66  typedef typename DSL::Position Position;
67 
68  unsigned int nbok = 0;
69  unsigned int nb = 0;
70 
71  trace.beginBlock ( "One simple test..." );
72 
73  trace.info() << aDSL << std::endl;
74 
75  //forward test
76  Position l = (2*aDSL.patternLength());
77  std::vector<Point> lch, uch;
78  Vector v = smartCH( aDSL, Point(0,0), l,
79  std::back_inserter(uch), std::back_inserter(lch) );
80 
81  if (v == Vector(aDSL.b(),aDSL.a())) //eq. 7
82  nbok++;
83  nb++;
84  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
85  if ( aDSL.remainder(lch.back()) == aDSL.mu()-1 ) //eq. 8
86  nbok++;
87  nb++;
88  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl; //eq. 8
89  if ( aDSL.remainder(uch.back()) == aDSL.mu() )
90  nbok++;
91  nb++;
92  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
93 
94  //test on the size of the convex hulls
95  double bound = NumberTraits<Integer>::castToDouble(aDSL.patternLength());
96  unsigned int threshold = (unsigned int) std::ceil( std::log(bound) / std::log(1.618) );
97  if ( (lch.size()+uch.size()-1) <= threshold )
98  nbok++;
99  nb++;
100  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
101 
102  trace.endBlock();
103 
104  return (nbok == nb);
105 }
void beginBlock(const std::string &keyword="")
DGtal::int32_t Integer
Definition: StdDefs.h:74
Trace trace
Definition: Common.h:144
double endBlock()
Aim: The traits class for all models of Cinteger.
Definition: NumberTraits.h:531
MyPointD Point
Definition: testClone2.cpp:383
std::ostream & info()
FreemanChain< int >::Vector Vector
PointVector smartCH(const PointVector &aFirstPoint, const Coordinate &aRemainderBound, const Position &aPositionBound, const PointVector &aStep, const Coordinate &aRStep, const PointVector &aShift, const Coordinate &aRShift, const PositionFunctor &aPositionFunctor, OutputIterator uIto, OutputIterator lIto)
Procedure that computes the lower and upper left hull of a DSS of first point aFirstPoint,...

References DGtal::Trace::beginBlock(), DGtal::Trace::endBlock(), DGtal::Trace::info(), DGtal::functions::smartCH(), and DGtal::trace.

Referenced by basicTest(), main(), and testWithoutLengthConstraint().

◆ basicTest() [2/2]

template<typename DSL >
bool basicTest ( typename DSL::Coordinate  a,
typename DSL::Coordinate  b 
)

Applies smartCH on a segment starting from (0,0) and contained in a naive DSL of slope a, b with various intercepts

Parameters
anumerator of the slope
bdenominator of the slope
Returns
'true' if the tests passed, 'false' otherwise
Template Parameters
DSLan arithmeticalDSL type (either naive or standard)

Definition at line 117 of file testArithmeticalDSSConvexHull.cpp.

119 {
120  unsigned int nbok = 0;
121  unsigned int nb = 0;
122 
123  DSL aDSL(a,b,0);
124  for (typename DSL::Integer mu = 0; ( (-mu < aDSL.omega())&&(nbok == nb) ); --mu)
125  {
126  if (basicTest(DSL(a,b,mu)))
127  nbok++;
128  nb++;
129  }
130 
131  return (nbok == nb);
132 }
bool basicTest(const DSL &aDSL)

References basicTest().

◆ basicTest2() [1/2]

template<typename DSL >
bool basicTest2 ( const DSL &  aDSL)

Applies reversedSmartCH on a segment starting from (0,0) and contained in a given arithmetical DSL

Parameters
aDSLany DSL
Returns
'true' if the algorithm returns correct values, 'false' otherwise
Template Parameters
DSLan arithmeticalDSL type (either naive or standard)

Definition at line 499 of file testArithmeticalDSSConvexHull.cpp.

500 {
501  typedef typename DSL::Point Point;
502  typedef typename DSL::Vector Vector;
503  typedef typename DSL::Coordinate Coordinate;
504  typedef typename DSL::Integer Integer;
505  typedef typename DSL::Position Position;
506 
507  unsigned int nbok = 0;
508  unsigned int nb = 0;
509 
510  trace.beginBlock ( "One simple test..." );
511 
512  //bounding DSS
514  Point A(0,0);
515  Position l = (2*aDSL.patternLength());
516  Point B = aDSL.getPoint( aDSL.position(A) + l + 1 );
517  DSS dss(aDSL.begin(A), aDSL.begin(B) );
518 
519  trace.info() << dss << std::endl;
520 
521  //computation
522  std::vector<Point> lch, uch;
524  std::back_inserter(uch), std::back_inserter(lch) );
525 
526  trace.info() << v << lch.back() << uch.back() << std::endl;
527 
528  if ( (uch.back() == A) && (lch.back() == A - aDSL.shift()) )
529  nbok++;
530  nb++;
531  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
532 
533  Vector LU = lch.back() - uch.back();
534  if ( (v[0]*LU[1] - v[1]*LU[0]) == NumberTraits<Coordinate>::ONE )
535  nbok++;
536  nb++;
537  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
538 
539  trace.endBlock();
540 
541  return (nbok == nb);
542 }
void beginBlock(const std::string &keyword="")
DGtal::int32_t Integer
Definition: StdDefs.h:74
Trace trace
Definition: Common.h:144
double endBlock()
PointVector reversedSmartCH(PointVector U, PointVector L, PointVector V, const Position &aFirstPosition, const Position &aLastPosition, const PositionFunctor &aPositionFunctor, OutputIterator uIto, OutputIterator lIto)
Procedure that computes the lower and upper left hull of the left subsegment of a greater DSS charact...
Aim: The traits class for all models of Cinteger.
Definition: NumberTraits.h:531
Aim: This class represents a naive (resp. standard) digital straight segment (DSS),...
MyPointD Point
Definition: testClone2.cpp:383
std::ostream & info()
FreemanChain< int >::Vector Vector

References DGtal::Trace::beginBlock(), DGtal::Trace::endBlock(), DGtal::Trace::info(), DGtal::functions::reversedSmartCH(), and DGtal::trace.

Referenced by basicTest2(), and testWithoutLengthConstraint2().

◆ basicTest2() [2/2]

template<typename DSL >
bool basicTest2 ( typename DSL::Coordinate  a,
typename DSL::Coordinate  b 
)

Applies reversedSmartCH on a segment starting from (0,0) and contained in a naive DSL of slope a, b with various intercepts

Parameters
anumerator of the slope
bdenominator of the slope
Returns
'true' if the tests passed, 'false' otherwise
Template Parameters
DSLan arithmeticalDSL type (either naive or standard)

Definition at line 554 of file testArithmeticalDSSConvexHull.cpp.

556 {
557  unsigned int nbok = 0;
558  unsigned int nb = 0;
559 
560  DSL aDSL(a,b,0);
561  for (typename DSL::Integer mu = 0; ( (-mu < aDSL.omega())&&(nbok == nb) ); --mu)
562  {
563  if (basicTest2(DSL(a,b,mu)))
564  nbok++;
565  nb++;
566  }
567 
568  return (nbok == nb);
569 }
bool basicTest2(const DSL &aDSL)

References basicTest2().

◆ comparisonLeftHull()

template<typename DSL >
bool comparisonLeftHull ( typename DSL::Coordinate  a,
typename DSL::Coordinate  b 
)

Compares smartCH to the algorithm of Charrier and Buzer, implemented in LatticePolytope2D.

Parameters
a(positive) numerator of the slope
b(positive) denominator of the slope
Precondition
b is greater than a, which is greater than 0.
Returns
'true' if the two algorithms return the same results, 'false' otherwise
Template Parameters
DSLan arithmeticalDSL type (either naive or standard)

Definition at line 196 of file testArithmeticalDSSConvexHull.cpp.

197 {
198  ASSERT(a >= 0);
199  ASSERT(b >= 0);
200  ASSERT(a < b);
201 
202  typedef typename DSL::Point Point;
203  typedef typename DSL::Vector Vector;
204  typedef typename DSL::Coordinate Coordinate;
205 
206  unsigned int nbok = 0;
207  unsigned int nb = 0;
208 
209  trace.beginBlock ( "Comparison ..." );
210  DSL inputDSL(a,b,0);
211 
212  trace.info() << a << " " << b << std::endl;
213  trace.info() << "testing every mu between 0 and -" << inputDSL.omega() << std::endl;
214 
215  for (typename DSL::Integer mu = 0; ( (mu-1 >= -inputDSL.omega())&&(nbok == nb) ); --mu)
216  {
217  trace.info() << "mu=" << mu << ", testing every length between 1 and 2*" << inputDSL.omega() << std::endl;
218  inputDSL = DSL(a,b,mu);
219 
220  for (typename DSL::Position l = 1; ( (l <= 2*inputDSL.patternLength())&&(nbok == nb) ); ++l)
221  {
222  //trace.info() << "l=" << l << std::endl;
223 
224  //smartCH
225  std::vector<Point> lch, uch;
226  Vector v = smartCH( inputDSL, Point(0,0), l,
227  std::back_inserter(uch), std::back_inserter(lch) );
228 
229  // std::copy( lch.begin(), lch.end(), std::ostream_iterator<Point>(std::cout, " ") );
230  // std::cout << std::endl;
231  // std::copy( uch.begin(), uch.end(), std::ostream_iterator<Point>(std::cout, " ") );
232  // std::cout << std::endl;
233 
234  Vector shift = -inputDSL.shift();
235  //algorithm of Charrier and Buzer
236  typedef SpaceND<2, Coordinate> Space2;
237  typedef LatticePolytope2D<Space2> CIP;
238  CIP cip;
239  typename CIP::HalfSpace line( typename CIP::Vector(a,-b), mu );
240  typename CIP::HalfSpace line2( typename CIP::Vector(a,-b), mu-1 );
241  //NB: since only closed half-space are used,
242  // we must run the procedure twice, for mu and mu-1
243  // in order to get the lower left hull (not included)
244  // and the upper left hull (included)
245  typename CIP::HalfSpace constraint( typename CIP::Vector(shift[1],-shift[0]), l );
246  std::vector<typename CIP::Point> inch, outch, inch2, outch2;
247  inch.push_back( typename CIP::Point(shift[0],shift[1]) );
248  inch2.push_back( typename CIP::Point(shift[0],shift[1]) );
249  ASSERT( line(inch[0]) );
250  ASSERT( constraint(inch[0]) );
251  outch.push_back( typename CIP::Point(0,0) );
252  outch2.push_back( typename CIP::Point(0,0) );
253  ASSERT( (!line2(outch[0])) );
254  ASSERT( constraint(outch[0]) );
255  typename CIP::Vector vBezout(1,0);
256  cip.getAllPointsOfHull(inch, outch, vBezout, line, constraint);
257  cip.getAllPointsOfHull(inch2, outch2, vBezout, line2, constraint);
258 
259  // std::copy( inch2.begin(), inch2.end(), std::ostream_iterator<typename CIP::Point>(std::cout, " ") );
260  // std::cout << std::endl;
261  // std::copy( outch.begin(), outch.end(), std::ostream_iterator<typename CIP::Point>(std::cout, " ") );
262  // std::cout << std::endl;
263 
264  //comparisons
265  std::unique(inch2.begin(), inch2.end());
266  if (std::equal(lch.begin(), lch.end(), inch2.begin()))
267  nbok++;
268  nb++;
269 
270  std::unique(outch.begin(), outch.end());
271  if (std::equal(uch.begin(), uch.end(), outch.begin()))
272  nbok++;
273  nb++;
274 
275  }
276  }
277 
278  trace.endBlock();
279 
280  return (nbok == nb);
281 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
double endBlock()
MyPointD Point
Definition: testClone2.cpp:383
std::ostream & info()
FreemanChain< int >::Vector Vector
PointVector smartCH(const PointVector &aFirstPoint, const Coordinate &aRemainderBound, const Position &aPositionBound, const PointVector &aStep, const Coordinate &aRStep, const PointVector &aShift, const Coordinate &aRShift, const PositionFunctor &aPositionFunctor, OutputIterator uIto, OutputIterator lIto)
Procedure that computes the lower and upper left hull of a DSS of first point aFirstPoint,...
Aim: Represents a 2D polytope, i.e. a convex polygon, in the two-dimensional digital plane....

References DGtal::Trace::beginBlock(), DGtal::Trace::endBlock(), DGtal::Trace::info(), DGtal::functions::smartCH(), and DGtal::trace.

Referenced by testWithLengthConstraint().

◆ comparisonSubsegment() [1/2]

template<typename DSL >
bool comparisonSubsegment ( const DSL &  aDSL,
typename DSL::Position  x,
typename DSL::Position  y 
)

Compares smartCH to the classical incremental recognition algorithm for one subgement of a given DSL

Parameters
aDSLDSL containing the subsegment
xminimal position
ymaximal position
Returns
'true' if results match, 'false' otherwise
Template Parameters
DSLan arithmetical DSL (either naive or standard)

Definition at line 397 of file testArithmeticalDSSConvexHull.cpp.

399 {
400  DSL dsl1 = smartCHSubsegment(aDSL, x, y);
401  DSL dsl2 = trivialSubsegment(aDSL, x, y);
402 
403  return (dsl1 == dsl2);
404 }
DSL smartCHSubsegment(const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)
DSL trivialSubsegment(const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)

References smartCHSubsegment(), and trivialSubsegment().

Referenced by comparisonSubsegment(), main(), and testSubsegment().

◆ comparisonSubsegment() [2/2]

template<typename DSL >
bool comparisonSubsegment ( typename DSL::Coordinate  a,
typename DSL::Coordinate  b 
)

Compares smartCH to the classical incremental recognition algorithm for various intercepts and lengths

Parameters
anumerator of the slope
bdenominator of the slope
Returns
'true' if the two algorithms return the same results, 'false' otherwise
Template Parameters
DSLan arithmetical DSL (either naive or standard)

Definition at line 416 of file testArithmeticalDSSConvexHull.cpp.

417 {
418  unsigned int nbok = 0;
419  unsigned int nb = 0;
420 
421  trace.beginBlock ( "Subsegment comparison ..." );
422 
423  DSL aDSL(a, b, 0);
424  for (typename DSL::Integer mu = 0; ( (mu-1 >= -aDSL.omega())&&(nbok == nb) ); --mu)
425  {
426  //trace.info() << "mu=" << mu << std::endl;
427 
428  typename DSL::Position f = -aDSL.patternLength();
429  for (typename DSL::Position l = 1; ( (l <= 2*aDSL.patternLength())&&(nbok == nb) ); ++l)
430  {
431  //trace.info() << "f=" << f << " l=" << l << std::endl;
432 
433  if (comparisonSubsegment(DSL(a, b, mu), f, f+l))
434  nbok++;
435  nb++;
436  }
437 
438  }
439 
440  trace.endBlock();
441 
442  return (nb == nbok);
443 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
double endBlock()
bool comparisonSubsegment(const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)

References DGtal::Trace::beginBlock(), comparisonSubsegment(), DGtal::Trace::endBlock(), and DGtal::trace.

◆ comparisonSubsegment2() [1/2]

template<typename DSS >
bool comparisonSubsegment2 ( const DSS &  aDSS,
typename DSS::Position  aBound 
)

Compares reversedSmartCH to the classical incremental recognition algorithm for one subgement of a greater DSS

Parameters
aDSSDSS containing the subsegment
aBoundmaximal position
Returns
'true' if results match, 'false' otherwise
Template Parameters
DSSan arithmetical DSS (either naive or standard)

Definition at line 664 of file testArithmeticalDSSConvexHull.cpp.

665 {
666  typedef typename DSS::DSL DSL;
667  DSL dsl1 = reversedSmartCHSubsegment(aDSS, aBound);
668  DSL dsl2 = trivialSubsegment(aDSS.dsl(), aDSS.position(aDSS.back()), aBound);
669 
670  return (dsl1 == dsl2);
671 }
DSS::DSL reversedSmartCHSubsegment(const DSS &aDSS, typename DSS::Position aBound)
DSL trivialSubsegment(const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)

References reversedSmartCHSubsegment(), and trivialSubsegment().

Referenced by comparisonSubsegment2(), and testSubsegment2().

◆ comparisonSubsegment2() [2/2]

template<typename DSL >
bool comparisonSubsegment2 ( typename DSL::Coordinate  a,
typename DSL::Coordinate  b 
)

Compares reversedSmartCH to the classical incremental recognition algorithm for various intercepts and lengths

Parameters
anumerator of the slope
bdenominator of the slope
Returns
'true' if the two algorithms return the same results, 'false' otherwise
Template Parameters
DSLan arithmetical DSL (either naive or standard)

Definition at line 685 of file testArithmeticalDSSConvexHull.cpp.

686 {
687  unsigned int nbok = 0;
688  unsigned int nb = 0;
689 
690  trace.beginBlock ( "Subsegment comparison ..." );
691 
692  DSL aDSL(a, b, 0);
693  for (typename DSL::Integer mu = 0; ( (mu-1 >= -aDSL.omega())&&(nbok == nb) ); --mu)
694  {
695  trace.info() << "mu=" << mu << std::endl;
696 
697  //computation of a bounding DSS
698  typedef typename DSL::Point Point;
699  typedef typename DSL::Coordinate Coordinate;
700  typedef typename DSL::Integer Integer;
702 
703  Point startingPoint = aDSL.getPoint(0);
704  ASSERT( aDSL(startingPoint) );
705  Point endingPoint = aDSL.getPoint(2*aDSL.patternLength()+1);
706  ASSERT( aDSL(endingPoint) );
707 
708  DSS dss = DSS(aDSL.begin(startingPoint), aDSL.begin(endingPoint));
709 
710  //test for a left subsegment
711  for (typename DSL::Position l = 1; ( (l <= 2*aDSL.patternLength())&&(nbok == nb) ); ++l)
712  {
713  trace.info() << "l=" << l << std::endl;
714 
715  if (comparisonSubsegment2(dss, l))
716  nbok++;
717  nb++;
718  }
719 
720  }
721 
722  trace.endBlock();
723 
724  return (nb == nbok);
725 }
void beginBlock(const std::string &keyword="")
DGtal::int32_t Integer
Definition: StdDefs.h:74
Trace trace
Definition: Common.h:144
double endBlock()
Aim: This class represents a naive (resp. standard) digital straight segment (DSS),...
MyPointD Point
Definition: testClone2.cpp:383
std::ostream & info()
bool comparisonSubsegment2(const DSS &aDSS, typename DSS::Position aBound)

References DGtal::Trace::beginBlock(), comparisonSubsegment2(), DGtal::Trace::endBlock(), DGtal::Trace::info(), and DGtal::trace.

◆ main()

int main ( int  argc,
char **  argv 
)

Definition at line 773 of file testArithmeticalDSSConvexHull.cpp.

774 {
775  trace.beginBlock ( "Testing class ArithmeticalDSSConvexHull" );
776  trace.info() << "Args:";
777  for ( int i = 0; i < argc; ++i )
778  trace.info() << " " << argv[ i ];
779  trace.info() << endl;
780 
781  if (argc >= 4)
782  { //basic test with a specified DSL
783  std::istringstream issb(argv[1]);
784  int b;
785  issb >> b;
786  std::istringstream issa(argv[2]);
787  int a;
788  issa >> a;
789  if ( (a <= 0)||(b <= 0) )
790  {
791  std::cerr << " a and b should be strictly positive " << std::endl;
792  return 1;
793  }
794  std::istringstream issmu(argv[3]);
795  int mu;
796  issmu >> mu;
797  if ( (mu > 0)||(mu <= -(std::max(std::abs(a),std::abs(b)))) )
798  {
799  std::cerr << " mu should be within the range ]-max(|a|,|b|); 0] " << std::endl;
800  return 1;
801  }
802 
803  bool res = basicTest( NaiveDSL<DGtal::int32_t>(a,b,mu) )
805  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
806  return res ? 0 : 1;
807  }
808 
809  //all automatic tests
810  bool res = true;
811  res = res
814  && testSubsegment()
816  && testSubsegment2()
817  ;
818 
819  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
820  trace.endBlock();
821  return res ? 0 : 1;
822 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
bool testWithoutLengthConstraint()
double endBlock()
bool comparisonSubsegment(const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)
Aim: This class is an alias of ArithmeticalDSS for naive DSL. It represents a naive digital straight ...
bool testWithLengthConstraint()
std::ostream & emphase()
bool testWithoutLengthConstraint2()
bool basicTest(const DSL &aDSL)
int max(int a, int b)
std::ostream & info()

References basicTest(), DGtal::Trace::beginBlock(), comparisonSubsegment(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), max(), testSubsegment(), testSubsegment2(), testWithLengthConstraint(), testWithoutLengthConstraint(), testWithoutLengthConstraint2(), and DGtal::trace.

◆ reversedSmartCHSubsegment()

template<typename DSS >
DSS::DSL reversedSmartCHSubsegment ( const DSS &  aDSS,
typename DSS::Position  aBound 
)

Computes the minimal parameters of a subsegment with reversedSmartCH

Parameters
aDSSDSS containing the subsegment
aBoundmaximal position
Returns
the computed DSL of minimal parameters
Template Parameters
DSSan arithmetical DSS (either naive or standard)

Definition at line 629 of file testArithmeticalDSSConvexHull.cpp.

631 {
632  ASSERT( (aBound - aDSS.position(aDSS.back())) > 0 );
633 
634  typedef typename DSS::Point Point;
635  typedef typename DSS::Vector Vector;
636  typedef typename DSS::Integer Integer;
637  typedef typename DSS::DSL DSL;
638 
639  Point startingPoint = aDSS.dsl().getPoint(aBound);
640 
641  //running reversedSmartCH
642  std::vector<Point> lch, uch;
643  Vector v = reversedSmartCH( aDSS, aBound,
644  std::back_inserter(uch), std::back_inserter(lch) );
645 
646  //computing the slope and the remainder of the last upper leaning point
647  Point upperLeaningPoint = uch.back();
648  Integer intercept = (static_cast<Integer>(upperLeaningPoint[0])*static_cast<Integer>(v[1])
649  -static_cast<Integer>(upperLeaningPoint[1])*static_cast<Integer>(v[0]));
650 
651  //trace.info() << "(" << v[1] << ", " << v[0] << ", " << intercept << ")" << std::endl;
652  return DSL( v[1],v[0],intercept );
653 }
DGtal::int32_t Integer
Definition: StdDefs.h:74
PointVector reversedSmartCH(PointVector U, PointVector L, PointVector V, const Position &aFirstPosition, const Position &aLastPosition, const PositionFunctor &aPositionFunctor, OutputIterator uIto, OutputIterator lIto)
Procedure that computes the lower and upper left hull of the left subsegment of a greater DSS charact...
MyPointD Point
Definition: testClone2.cpp:383
FreemanChain< int >::Vector Vector

References DGtal::functions::reversedSmartCH().

Referenced by comparisonSubsegment2().

◆ smartCHSubsegment()

template<typename DSL >
DSL smartCHSubsegment ( const DSL &  aDSL,
typename DSL::Position  x,
typename DSL::Position  y 
)

Computes the minimal parameters of a subsegment with smartCH

Parameters
aDSLDSL containing the subsegment
xminimal position
ymaximal position
Precondition
x != y
Returns
the computed DSL of minimal parameters
Template Parameters
DSLan arithmetical DSL (either naive or standard)

Definition at line 318 of file testArithmeticalDSSConvexHull.cpp.

320 {
321  ASSERT((y-x) > 0);
322 
323  typedef typename DSL::Point Point;
324  typedef typename DSL::Vector Vector;
325  typedef typename DSL::Integer Integer;
326 
327  Point startingPoint = aDSL.getPoint(x);
328 
329  //running smartCH
330  std::vector<Point> lch, uch;
331  Vector v = smartCH( aDSL, startingPoint, (y-x),
332  std::back_inserter(uch), std::back_inserter(lch) );
333 
334  //computing the slope and the remainder of the last upper leaning point
335  Point upperLeaningPoint = uch.back();
336  Integer intercept = (static_cast<Integer>(upperLeaningPoint[0])*static_cast<Integer>(v[1])
337  -static_cast<Integer>(upperLeaningPoint[1])*static_cast<Integer>(v[0]));
338 
339  // trace.info() << "(" << v[1] << ", " << v[0] << ", " << intercept << ")" << std::endl;
340  return DSL( v[1],v[0],intercept );
341 }
DGtal::int32_t Integer
Definition: StdDefs.h:74
MyPointD Point
Definition: testClone2.cpp:383
FreemanChain< int >::Vector Vector
PointVector smartCH(const PointVector &aFirstPoint, const Coordinate &aRemainderBound, const Position &aPositionBound, const PointVector &aStep, const Coordinate &aRStep, const PointVector &aShift, const Coordinate &aRShift, const PositionFunctor &aPositionFunctor, OutputIterator uIto, OutputIterator lIto)
Procedure that computes the lower and upper left hull of a DSS of first point aFirstPoint,...

References DGtal::functions::smartCH().

Referenced by comparisonSubsegment().

◆ testSubsegment()

bool testSubsegment ( )

Testing function.

Definition at line 448 of file testArithmeticalDSSConvexHull.cpp.

449 {
450  trace.beginBlock ( "Testing block for the subsegment problem..." );
451 
452  bool res = true;
453  res = res
454  && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(5,8)
456  && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(12,29)
458  && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(8,5)
460  && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(-8,5)
462  && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(8,-5)
464  && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(-8,-5)
465 
467  && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(8,13)
469  && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(29,70)
471  && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(-5,8)
473  && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(5,-8)
475  && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(-5,-8)
477 
478 #ifdef WITH_BIGINTEGER
479  && comparisonSubsegment<NaiveDSL<DGtal::int32_t,DGtal::BigInteger> >(5,8)
481 #endif
482  ;
483 
484  trace.endBlock();
485 
486  return res;
487 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
double endBlock()
bool comparisonSubsegment(const DSL &aDSL, typename DSL::Position x, typename DSL::Position y)
Aim: This class is an alias of ArithmeticalDSS for naive DSL. It represents a naive digital straight ...
Aim: This class is an alias of ArithmeticalDSS for standard DSL. It represents a standard digital str...

References DGtal::Trace::beginBlock(), comparisonSubsegment(), DGtal::Trace::endBlock(), and DGtal::trace.

Referenced by main().

◆ testSubsegment2()

bool testSubsegment2 ( )

Testing function.

Definition at line 730 of file testArithmeticalDSSConvexHull.cpp.

731 {
732  trace.beginBlock ( "Testing block for the subsegment problem..." );
733 
734  bool res = true;
735  res = res
736  && comparisonSubsegment2<NaiveDSL<DGtal::int32_t> >(5,8)
738  && comparisonSubsegment2<NaiveDSL<DGtal::int32_t> >(12,29)
740  && comparisonSubsegment2<NaiveDSL<DGtal::int32_t> >(8,5)
742  && comparisonSubsegment2<NaiveDSL<DGtal::int32_t> >(-8,5)
744  && comparisonSubsegment2<NaiveDSL<DGtal::int32_t> >(8,-5)
746  && comparisonSubsegment2<NaiveDSL<DGtal::int32_t> >(-8,-5)
747 
749  && comparisonSubsegment2<StandardDSL<DGtal::int32_t> >(8,13)
751  && comparisonSubsegment2<StandardDSL<DGtal::int32_t> >(29,70)
753  && comparisonSubsegment2<StandardDSL<DGtal::int32_t> >(-5,8)
755  && comparisonSubsegment2<StandardDSL<DGtal::int32_t> >(5,-8)
757  && comparisonSubsegment2<StandardDSL<DGtal::int32_t> >(-5,-8)
759 
760 #ifdef WITH_BIGINTEGER
761  && comparisonSubsegment2<NaiveDSL<DGtal::int32_t,DGtal::BigInteger> >(5,8)
763 #endif
764  ;
765 
766  trace.endBlock();
767 
768  return res;
769 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
double endBlock()
Aim: This class is an alias of ArithmeticalDSS for naive DSL. It represents a naive digital straight ...
Aim: This class is an alias of ArithmeticalDSS for standard DSL. It represents a standard digital str...
bool comparisonSubsegment2(const DSS &aDSS, typename DSS::Position aBound)

References DGtal::Trace::beginBlock(), comparisonSubsegment2(), DGtal::Trace::endBlock(), and DGtal::trace.

Referenced by main().

◆ testWithLengthConstraint()

bool testWithLengthConstraint ( )

Testing function.

Definition at line 286 of file testArithmeticalDSSConvexHull.cpp.

287 {
288  trace.beginBlock ( "Testing block (with length constraint)..." );
289 
290  bool res = true;
291  res = res
292  && comparisonLeftHull<NaiveDSL<DGtal::int32_t> >(5,8)
294  && comparisonLeftHull<NaiveDSL<DGtal::int32_t> >(12,29)
296 
297  && comparisonLeftHull<StandardDSL<DGtal::int32_t> >(5,8)
299  && comparisonLeftHull<StandardDSL<DGtal::int32_t> >(12,29)
301  ;
302 
303  trace.endBlock();
304 
305  return res;
306 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
double endBlock()
bool comparisonLeftHull(typename DSL::Coordinate a, typename DSL::Coordinate b)
Aim: This class is an alias of ArithmeticalDSS for naive DSL. It represents a naive digital straight ...
Aim: This class is an alias of ArithmeticalDSS for standard DSL. It represents a standard digital str...

References DGtal::Trace::beginBlock(), comparisonLeftHull(), DGtal::Trace::endBlock(), and DGtal::trace.

Referenced by main().

◆ testWithoutLengthConstraint()

bool testWithoutLengthConstraint ( )

Testing function.

Definition at line 137 of file testArithmeticalDSSConvexHull.cpp.

138 {
139  trace.beginBlock ( "Testing block (without length constraint)..." );
140 
141  bool res = true;
142  res = res
143  && basicTest<NaiveDSL<DGtal::int32_t> >(5,8)
145  && basicTest<NaiveDSL<DGtal::int32_t> >(12,29)
147  && basicTest<NaiveDSL<DGtal::int32_t> >(70,29)
149  && basicTest<NaiveDSL<DGtal::int32_t> >(-70,29)
151  && basicTest<NaiveDSL<DGtal::int32_t> >(70,-29)
152  && basicTest<NaiveDSL<DGtal::int32_t> >(-29,-70)
153  && basicTest<NaiveDSL<DGtal::int32_t> >(-70,-29)
154 
156  && basicTest<StandardDSL<DGtal::int32_t> >(8,13)
158  && basicTest<StandardDSL<DGtal::int32_t> >(29,70)
160  && basicTest<StandardDSL<DGtal::int32_t> >(-29,70)
162  && basicTest<StandardDSL<DGtal::int32_t> >(29,-70)
164  && basicTest<StandardDSL<DGtal::int32_t> >(-29,-70)
166 
167 
168  && basicTest<NaiveDSL<DGtal::int32_t> >(33, 109)
169  && basicTest<NaiveDSL<DGtal::int32_t> >(109, 360)
170  && basicTest<NaiveDSL<DGtal::int32_t> >(8, 73)
172 #ifdef WITH_BIGINTEGER
173  && basicTest<NaiveDSL<DGtal::int32_t,DGtal::BigInteger> >(57, 520)
175 #endif
176 
177  ;
178 
179  trace.endBlock();
180 
181  return res;
182 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
double endBlock()
Aim: This class is an alias of ArithmeticalDSS for naive DSL. It represents a naive digital straight ...
Aim: This class is an alias of ArithmeticalDSS for standard DSL. It represents a standard digital str...
bool basicTest(const DSL &aDSL)

References basicTest(), DGtal::Trace::beginBlock(), DGtal::Trace::endBlock(), and DGtal::trace.

Referenced by main().

◆ testWithoutLengthConstraint2()

bool testWithoutLengthConstraint2 ( )

Testing function.

Definition at line 574 of file testArithmeticalDSSConvexHull.cpp.

575 {
576  trace.beginBlock ( "Testing block (without length constraint)..." );
577 
578  bool res = true;
579  res = res
580  && basicTest2<NaiveDSL<DGtal::int32_t> >(5,8)
582  && basicTest2<NaiveDSL<DGtal::int32_t> >(12,29)
584  && basicTest2<NaiveDSL<DGtal::int32_t> >(70,29)
586  && basicTest2<NaiveDSL<DGtal::int32_t> >(-70,29)
588  && basicTest2<NaiveDSL<DGtal::int32_t> >(70,-29)
590  && basicTest2<NaiveDSL<DGtal::int32_t> >(-70,-29)
591 
593  && basicTest2<StandardDSL<DGtal::int32_t> >(8,13)
595  && basicTest2<StandardDSL<DGtal::int32_t> >(29,70)
597  && basicTest2<StandardDSL<DGtal::int32_t> >(-29,70)
599  && basicTest2<StandardDSL<DGtal::int32_t> >(29,-70)
601  && basicTest2<StandardDSL<DGtal::int32_t> >(-29,-70)
603 
604 
605  && basicTest2<NaiveDSL<DGtal::int32_t> >(33, 109)
606  && basicTest2<NaiveDSL<DGtal::int32_t> >(109, 360)
607  && basicTest2<NaiveDSL<DGtal::int32_t> >(8, 73)
609 #ifdef WITH_BIGINTEGER
610  && basicTest2<NaiveDSL<DGtal::int32_t,DGtal::BigInteger> >(57, 520)
612 #endif
613 
614  ;
615 
616  trace.endBlock();
617 
618  return res;
619 }
void beginBlock(const std::string &keyword="")
Trace trace
Definition: Common.h:144
bool basicTest2(const DSL &aDSL)
double endBlock()
Aim: This class is an alias of ArithmeticalDSS for naive DSL. It represents a naive digital straight ...
Aim: This class is an alias of ArithmeticalDSS for standard DSL. It represents a standard digital str...

References basicTest2(), DGtal::Trace::beginBlock(), DGtal::Trace::endBlock(), and DGtal::trace.

Referenced by main().

◆ trivialSubsegment()

template<typename DSL >
DSL trivialSubsegment ( const DSL &  aDSL,
typename DSL::Position  x,
typename DSL::Position  y 
)

Computes the minimal parameters of a subsegment with the classical recognition algorithm, implemented in ArithmeticalDSS.

Parameters
aDSLDSL containing the subsegment
xminimal position
ymaximal position
Precondition
x != y
Returns
the computed DSL of minimal parameters
Template Parameters
DSLan arithmetical DSL (either naive or standard)

Definition at line 356 of file testArithmeticalDSSConvexHull.cpp.

358 {
359  ASSERT((y-x) > 0);
360 
361  typedef typename DSL::Point Point;
362  typedef typename DSL::Coordinate Coordinate;
363  typedef typename DSL::Integer Integer;
364  typedef typename DSL::ConstIterator ConstIterator;
366 
367  Point startingPoint = aDSL.getPoint(x);
368  ASSERT( aDSL(startingPoint) );
369  Point endingPoint = aDSL.getPoint(y);
370  ASSERT( aDSL(endingPoint) );
371 
372  ConstIterator it = aDSL.begin(startingPoint);
373  ConstIterator ite = aDSL.end(endingPoint);
374  ASSERT (it != ite);
375 
376  DSS dss = DSS(*it);
377  for (++it; (it != ite); ++it)
378  {
379  dss.extendFront(*it);
380  }
381 
382  //trace.info() << "(" << dss.a() << ", " << dss.b() << ", " << dss.mu() << ")" << std::endl;
383  return DSL(dss.a(), dss.b(), dss.mu());
384 }
DGtal::int32_t Integer
Definition: StdDefs.h:74
MyDigitalSurface::ConstIterator ConstIterator
Aim: This class represents a naive (resp. standard) digital straight segment (DSS),...
MyPointD Point
Definition: testClone2.cpp:383

Referenced by comparisonSubsegment(), and comparisonSubsegment2().