testArithmeticalDSS.cpp File Reference

#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/CPointPredicate.h"
#include "DGtal/base/CConstBidirectionalRange.h"
#include "DGtal/geometry/curves/ArithmeticalDSS.h"
#include "DGtal/geometry/curves/ArithmeticalDSSFactory.h"
#include "DGtal/geometry/curves/StabbingLineComputer.h"

Include dependency graph for testArithmeticalDSS.cpp:

Go to the source code of this file.

Functions
template<typename DSS >
bool	mainTest ()
template<typename DSS >
bool	rangeTest (const DSS &dss)
template<typename DSS >
void	extensionTest (const DSS &dss, typename DSS::Point newPointToFront, typename DSS::Point newPointToBack, unsigned int &nbok, unsigned int &nb, const unsigned short int &code=0)
template<typename DSS >
void	retractionTest (const DSS &dss, unsigned int &nbok, unsigned int &nb, bool res=true)
template<typename DSS >
bool	updateTest ()
template<typename DSS >
bool	compatibleStepsTest (const DSS &dss)
template<typename DSS >
bool	constructorsTest ()
template<typename DSS >
bool	comparisonSubsegment (const DSS &aDSS, typename DSS::Position x, typename DSS::Position y)
template<typename DSL >
bool	comparisonSubsegment (typename DSL::Coordinate a, typename DSL::Coordinate b)
bool	unionTest ()
int	max (int a, int b)
template<typename TCoordinate , typename TInteger , unsigned short adjacency>
bool	unionComparisonTest (int modb, int modx, unsigned int nbtries)
bool	createDSSTest ()
bool	testPatchCreatePattern ()
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

2013/06/28

Functions for testing class ArithmeticalDSS.

This file is part of the DGtal library.

Definition in file testArithmeticalDSS.cpp.

Function Documentation

comparisonSubsegment() [1/2]

template<typename DSS >

bool comparisonSubsegment	(	const DSS &	aDSS,
		typename DSS::Position	x,
		typename DSS::Position	y
	)

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

Parameters

aDSS	DSS containing the subsegment
x	minimal position
y	maximal position

Returns

'true' if results match, 'false' otherwise

Template Parameters

DSS	an arithmetical DSS (either naive or standard)

Definition at line 812 of file testArithmeticalDSS.cpp.

{
  typename DSS::DSL dsl = aDSS.dsl(); 
  DSS dss0( dsl.begin(dsl.getPoint(x)), dsl.end(dsl.getPoint(y)) ); //classical (linear-time)
  DSS dss1( dsl, dsl.getPoint(x), dsl.getPoint(y) ); //smartCH (log)
  DSS dss2( aDSS, dsl.getPoint(x), dsl.getPoint(y) ); //reversedSmartCH (log)
  return ( (dss0 == dss1)&&(dss0 == dss2) ); 
}

Referenced by comparisonSubsegment(), and main().

comparisonSubsegment() [2/2]

template<typename DSL >

bool comparisonSubsegment	(	typename DSL::Coordinate	a,
		typename DSL::Coordinate	b
	)

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

Parameters

a	numerator of the slope
b	denominator of the slope

Returns

'true' if the two algorithms return the same results, 'false' otherwise

Template Parameters

DSL	an arithmetical DSL (either naive or standard)

Definition at line 833 of file testArithmeticalDSS.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "Subsegment comparison ..." );
 
  DSL aDSL(a, b, 0); 
  for (typename DSL::Integer mu = 0; ( (mu-1 >= -aDSL.omega())&&(nbok == nb) ); --mu)
    {
      //trace.info() << "mu=" << mu << std::endl; 
 
      typedef typename DSL::Point Point; 
      typedef typename DSL::Coordinate Coordinate; 
      typedef typename DSL::Integer Integer; 
      typedef ArithmeticalDSS<Coordinate,Integer,DSL::foregroundAdjacency> DSS; 
 
      Point startingPoint = aDSL.getPoint(0); 
      ASSERT( aDSL(startingPoint) ); 
      Point endingPoint = aDSL.getPoint(2*aDSL.patternLength()+1); 
      ASSERT( aDSL(endingPoint) ); 
 
      DSS dss = DSS(aDSL.begin(startingPoint), aDSL.end(endingPoint)); 
 
      for (typename DSL::Position l = 0; ( (l <= 2*aDSL.patternLength())&&(nbok == nb) ); ++l)
        {
          //trace.info() << "l=" << l << std::endl; 
 
          for (typename DSL::Position k = 0; ( (k <= l)&&(nbok == nb) ); ++k)
            {
              //trace.info() << "k=" << k << std::endl; 
 
              if (comparisonSubsegment(dss, k, l))
                nbok++;
              nb++; 
 
            }
        }
 
    }
 
  trace.endBlock(); 
 
  return (nb == nbok); 
}

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

compatibleStepsTest()

template<typename DSS >

bool compatibleStepsTest

(

const DSS &

dss

)

Test of the directional position and the checks of the steps

Parameters

dss	an instance of DSS

Template Parameters

DSS	a model of arithmetical DSS, either naive or standard

Definition at line 659 of file testArithmeticalDSS.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "directional Position..." );
 
  trace.info() << "shift: " << dss.shift()
               << ", front pos: " << dss.position( dss.front() )
               << ", back pos:  " << dss.position( dss.back() ) << std::endl;
  if ( dss.position( dss.front() )
       > dss.position( dss.back() ) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.endBlock();
 
  trace.beginBlock ( "Compatible steps..." );
 
  DSS mdss = dss;
  if ( mdss.extendFront(mdss.front()-dss.shift()+dss.steps().first) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  mdss = dss;
  if ( !mdss.extendFront(mdss.front()-dss.shift()) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  mdss = dss;
  if ( !mdss.extendFront(mdss.front()-dss.shift()-dss.steps().first) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  mdss = dss;
  if ( mdss.extendBack(mdss.back()+dss.shift()-dss.steps().first) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  mdss = dss;
  if ( !mdss.extendBack(mdss.back()+dss.shift()) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  mdss = dss;
  if ( !mdss.extendBack(mdss.back()+dss.shift()+dss.steps().first) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.endBlock();
 
  return nbok == nb;
}

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

Referenced by main().

constructorsTest()

template<typename DSS >

bool constructorsTest

(

)

Test of the main constructors

Template Parameters

DSS	a model of arithmetical DSS, either naive or standard

Definition at line 740 of file testArithmeticalDSS.cpp.

{
  BOOST_CONCEPT_ASSERT(( concepts::CPointPredicate<DSS> ));
  BOOST_CONCEPT_ASSERT(( concepts::CConstBidirectionalRange<DSS> ));
 
  typedef typename DSS::Point Point;
 
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "constructors..." );
 
  {
    //pattern
    DSS dss0( Point(0,0), Point(8,5) );
    trace.info() << dss0 << std::endl;
 
    //construction by points range
    DSS dss( dss0.begin(), dss0.end() );
    trace.info() << dss << std::endl;
 
    if ( (dss0.isValid())
         &&(dss.isValid())
         && (dss0 == dss)
         && (dss.Lf() == dss.Ll())
         && (dss.Uf() == dss.back())
         && (dss.Ul() == dss.front())
         && (dss.back() != dss.front()) )
      nbok++;
    nb++;
    trace.info() << "(" << nbok << "/" << nb << ") "
                 << std::endl;
 
    //reversed pattern
    DSS rdss0( Point(0,0), Point(8,5), false );
    trace.info() << rdss0 << std::endl;
 
    //construction by points range
    DSS rdss( rdss0.begin(), rdss0.end() );
    trace.info() << rdss << std::endl;
 
    if ( (rdss0.isValid())
         &&(rdss.isValid())
         && (rdss0 == rdss)
         && (rdss.Uf() == rdss.Ul())
         && (rdss.Lf() == rdss.back())
         && (rdss.Ll() == rdss.front())
         && (rdss.back() != rdss.front())
         && (rdss != dss) )
      nbok++;
    nb++;
    trace.info() << "(" << nbok << "/" << nb << ") "
                 << std::endl;
 
  }
 
  trace.endBlock();
 
  return nbok == nb;
}

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

Referenced by main().

createDSSTest()

bool createDSSTest

(

)

Definition at line 1302 of file testArithmeticalDSS.cpp.

{
  unsigned int nb = 0;
  unsigned int nbok = 0;
  
  trace.beginBlock("Testing creation of a DSS from direction vector, two endpoints and one upper leaning point");
  
  typedef DGtal::ArithmeticalDSS<DGtal::int32_t> DSS8;
  typedef DSS8::Point Point;
  typedef DGtal::ArithmeticalDSSFactory<DGtal::int32_t> Factory;
  nb++;
  nbok += (Factory::createDSS(3,5,Point(-6,-4),Point(14,8),Point(5,3)) == DSS8(3,5,Point(-6,-4),Point(14,8),Point(-5,-3),Point(10,6),Point(-2,-2),Point(13,7)))?1:0;
 
  nb++;
  nbok += (Factory::createDSS(3,5,Point(0,0),Point(14,8),Point(3,2)) == DSS8(3,5,Point(0,0),Point(14,8),Point(3,2),Point(13,8),Point(1,0),Point(11,6)))?1:0;
 
  nb++;
  nbok += (Factory::createDSS(3,5,Point(-3,-2),Point(14,8),Point(3,2)) == DSS8(3,5,Point(-3,-2),Point(14,8),Point(-2,-1),Point(13,8),Point(1,0),Point(11,6)))?1:0;
 
  nb++;
  nbok += (Factory::createDSS(3,5,Point(0,0),Point(14,8),Point(3,2)) == DSS8(3,5,Point(0,0),Point(14,8),Point(3,2),Point(13,8),Point(1,0),Point(11,6)))?1:0;
 
  nb++;
  nbok += (Factory::createDSS(3,5,Point(0,0),Point(14,8),Point(3,2)) == DSS8(3,5,Point(0,0),Point(14,8),Point(3,2),Point(13,8),Point(1,0),Point(11,6)))?1:0;
                                                                   
  trace.endBlock();
 
  return (nb==nbok);
}

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

Referenced by main().

extensionTest()

template<typename DSS >

void extensionTest	(	const DSS &	dss,
		typename DSS::Point	newPointToFront,
		typename DSS::Point	newPointToBack,
		unsigned int &	nbok,
		unsigned int &	nb,
		const unsigned short int &	code = 0
	)

Unit test of the extension service

Parameters

dss	an instance of DSS

Template Parameters

DSS	a model of arithmetical DSS, either naive or standard

Parameters

newPointToFront	point to add to the dss front
newPointToBack	point to add to the dss back
nbok	(returned) number of passed tests
nb	(returned) number of tests
code	index of the tested configuration

Definition at line 289 of file testArithmeticalDSS.cpp.

{
  trace.info() << dss << std::endl;
  if (dss.isValid())
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  trace.info() << "to front " << newPointToFront << std::endl;
  if (dss.isExtendableFront( newPointToFront ) == code)
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  DSS mdss = dss; //local and modifiable copy
  if (code == 0)
    {
      if ( (!mdss.extendFront(newPointToFront)) )
        nbok++;
      nb++;
    }
  else
    {
      if ( (mdss.extendFront(newPointToFront))&&(mdss.isValid()) )
        nbok++;
      nb++;
      std::cerr << mdss.isValid() << std::endl;
    }
  trace.info() << mdss << std::endl;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  trace.info() << "to back " << newPointToBack << std::endl;
  if (dss.isExtendableBack( newPointToBack ) == code)
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  mdss = dss; //local and modifiable copy
  if (code == 0)
    {
      if ( (!mdss.extendBack(newPointToBack)) )
        nbok++;
      nb++;
    }
  else
    {
      if ( (mdss.extendBack(newPointToBack))&&(mdss.isValid()) )
        nbok++;
      nb++;
      std::cerr << mdss.isValid() << std::endl;
    }
  trace.info() << mdss << std::endl;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
}

References DGtal::Trace::info(), and DGtal::trace.

Referenced by updateTest().

main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 1359 of file testArithmeticalDSS.cpp.

{
  trace.beginBlock ( "Testing class ArithmeticalDSS" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;
 
  //main operators
  bool res = mainTest<DGtal::ArithmeticalDSS<DGtal::int32_t> >()
#ifdef WITH_BIGINTEGER
    && mainTest<DGtal::ArithmeticalDSS<DGtal::int32_t, DGtal::BigInteger, 4> >()
#endif
    && mainTest<DGtal::NaiveDSS8<DGtal::int32_t> >()
    && mainTest<DGtal::StandardDSS4<DGtal::int32_t> >()
    ;
 
  {   //range services for 8 adjacency
    typedef DGtal::ArithmeticalDSS<DGtal::int32_t> DSS8;
    typedef DGtal::ArithmeticalDSSFactory<DGtal::int32_t> Factory;
    typedef DSS8::Point Point;
 
    res = res
      && rangeTest( Factory::createPattern(Point(0,0), Point(8,5)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(5,8)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-5,8)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-8,5)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-8,-5)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-5,-8)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(5,-8)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(8,-5)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(1,0)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-1,0)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(0,1)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(0,-1)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(1,1)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-1,1)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(1,-1)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-1,-1)) )
      && rangeTest( Factory::createReversedPattern(Point(0,0), Point(8,5)) )
      && rangeTest( Factory::createReversedPattern(Point(0,0), Point(5,8)) )
      ;
  }
 
 
  {  //range services for 4 adjacency
    typedef DGtal::ArithmeticalDSS<DGtal::int32_t, DGtal::int32_t, 4> DSS4;
    typedef DGtal::ArithmeticalDSSFactory<DGtal::int32_t, DGtal::int32_t, 4> Factory;
    typedef DSS4::Point Point;
 
    res = res
      && rangeTest( Factory::createPattern(Point(0,0), Point(8,5)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(5,8)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-8,-5)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-5,-8)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(5,-8)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(8,-5)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(1,0)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(-1,0)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(0,1)) )
      && rangeTest( Factory::createPattern(Point(0,0), Point(0,-1)) )
      && rangeTest( Factory::createReversedPattern(Point(0,0), Point(8,5)) )
      ;
  }
 
  {
    typedef DGtal::ArithmeticalDSS<DGtal::int32_t> DSS8;
    typedef DGtal::ArithmeticalDSSFactory<DGtal::int32_t> Factory;
    typedef DSS8::Point Point;
    res = res
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(5,0)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(-5,0)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(0,5)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(0,-5)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(5,5)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(5,-5)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(-5,5)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(-5,-5)) )
      ;
  }
 
  {
    typedef DGtal::ArithmeticalDSS<DGtal::int32_t, DGtal::int32_t, 4> DSS4;
    typedef DGtal::ArithmeticalDSSFactory<DGtal::int32_t, DGtal::int32_t, 4> Factory;
    typedef DSS4::Point Point;
    res = res
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(5,0)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(-5,0)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(0,5)) )
      && compatibleStepsTest( Factory::createPattern(Point(0,0), Point(0,-5)) )
      ;
  }
  
  res = res
    && updateTest<DGtal::ArithmeticalDSS<DGtal::int32_t> >()
#ifdef WITH_BIGINTEGER
    && updateTest<DGtal::ArithmeticalDSS<DGtal::int32_t, DGtal::BigInteger, 4> >()
#endif
    ;
 
  res = res
    && constructorsTest<DGtal::ArithmeticalDSS<DGtal::int32_t> >()
#ifdef WITH_BIGINTEGER
    && constructorsTest<DGtal::ArithmeticalDSS<DGtal::int32_t, DGtal::BigInteger, 4> >()
#endif
    && constructorsTest<DGtal::NaiveDSS8<DGtal::int32_t> >()
    && constructorsTest<DGtal::StandardDSS4<DGtal::int32_t> >()
    ;
 
  {   //subsegment 
  res = res 
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(5,8)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(8,13)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(12,29)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(8,5)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(-5,8)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(-8,5)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(5,-8)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(8,-5)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(-5,-8)
    && comparisonSubsegment<NaiveDSL<DGtal::int32_t> >(-8,-5)
 
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(5,8)
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(8,5)
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(-5,8)
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(-8,5)
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(5,-8)
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(8,-5)
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(-5,-8)
    && comparisonSubsegment<StandardDSL<DGtal::int32_t> >(-8,-5)
#ifdef WITH_BIGINTEGER
    && comparisonSubsegment<StandardDSL<DGtal::int32_t, DGtal::BigInteger> >(5,8)
#endif
      ;
  }
  
  { // createDSS
    res = res && createDSSTest();
  }
  
  { // Patch BezoutVector / CreatePattern
    res = res && testPatchCreatePattern();
  }
  
  { // union of two DSSs
    res = res && unionTest();
    res = res && unionComparisonTest<DGtal::int64_t,DGtal::int64_t,8>(43577,1276,200);
    res = res && unionComparisonTest<DGtal::int64_t, DGtal::int64_t, 4>(86731,6648,200);
      }
  
  
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}

References DGtal::Trace::beginBlock(), comparisonSubsegment(), compatibleStepsTest(), constructorsTest(), createDSSTest(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), mainTest(), rangeTest(), testPatchCreatePattern(), DGtal::trace, unionTest(), and updateTest().

mainTest()

template<typename DSS >

bool mainTest

(

)

Test of the main operators

Template Parameters

DSS	a model of arithmetical DSS, either naive or standard

Definition at line 52 of file testArithmeticalDSS.cpp.

{
  BOOST_CONCEPT_ASSERT(( concepts::CPointPredicate<DSS> ));
  BOOST_CONCEPT_ASSERT(( concepts::CConstBidirectionalRange<DSS> ));
 
  typedef typename DSS::Point Point;
 
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "Main operators..." );
 
  //operateur constructeur, copie, affectation
  trace.info() << "constructor, copy, assignement, equality" << std::endl;
 
  DSS dss(0, 1,
          Point(0,0), Point(1,0),
          Point(0,0), Point(1,0),
          Point(0,0), Point(1,0) );
  DSS dss2 = dss;
  DSS dss3(Point(0,0), Point(1,1), true);
  DSS dss4 = dss3;
  dss3 = dss2 = dss;
 
  //egalite, difference
  DSS dss5(0, -1,
           Point(1,0), Point(0,0),
           Point(1,0), Point(0,0),
           Point(1,0), Point(0,0) );
 
  if ( (dss == dss2)
       &&(dss == dss3)
       &&(dss != dss4)
       &&(dss == dss5) )
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  //validite
  trace.info() << "valid dss" << std::endl;
  if ( dss.isValid() && dss3.isValid() && dss5.isValid() )
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  DSS dss6(0, 1,
           Point(1,0), Point(0,0),
           Point(1,0), Point(0,0),
           Point(1,0), Point(0,0) );
 
  trace.info() << "not valid dss" << std::endl;
  if (!dss6.isValid())
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  //accessors
  trace.info() << "a,b,mu,omega accessors" << std::endl;
 
  if ( (dss.a() == 0)&&(dss.b() == 1)&&(dss.mu() == 0)&&(dss.omega() == 1) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.info() << "points accessors" << std::endl;
  if ( (dss.front() == Point(1,0))&&(dss.back() == Point(0,0)) )
    nbok++;
  nb++;
  if ( (dss.Ul() == Point(1,0))&&(dss.Uf() == Point(0,0)) )
    nbok++;
  nb++;
  if ( (dss.Ll() == Point(1,0))&&(dss.Lf() == Point(0,0)) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  DSS dss7(Point(0,0), Point(8,5), true);
 
  trace.info() << "remainder, position, tests" << std::endl;
  trace.info() << dss7 << std::endl;
 
  if ( (dss7.isValid())
       && (dss7.remainder( Point(8,5) ) == 0)
       &&(dss7.remainder( Point(16,10) ) == 0)
       &&(dss7.remainder( Point(3,2) ) == -1)
       &&(dss7.remainder( Point(5,3) ) == 1) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  if ( (dss7.orthogonalPosition( Point(0,0) ) == 0)
       &&(dss7.orthogonalPosition( Point(8,5) ) == 89)
       &&(dss7.orthogonalPosition( Point(1,0) ) == 8)
       &&(dss7.orthogonalPosition( Point(-1,0) ) == -8) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  if ( (dss7.isInDSL( Point(0,0) ))
       &&(dss7.isInDSL( Point(16,10) ))
       &&(dss7.isInDSL( Point(5,3) ))
       &&(!dss7.isInDSL( Point(3,2) )) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  if ( (dss7( Point(0,0) ))
       &&(!dss7( Point(16,10) ))
       &&(dss7( Point(5,3) ))
       &&(!dss7( Point(3,2) ))
       &&(!dss7( Point(-1,0) )) )
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.info() << "shift" << std::endl;
  if (dss.remainder(dss.shift()) == dss.omega())
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.endBlock();
 
  return nbok == nb;
}

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

Referenced by main().

max()

int max	(	int	a,
		int	b
	)

Examples

geometry/volumes/distance/distancetransform3D.cpp, and geometry/volumes/distance/toricdomainvolumetric.cpp.

Definition at line 1108 of file testArithmeticalDSS.cpp.

{
  return ((a>b)?a:b);
}

Referenced by accuracyTest(), DGtal::detail::toCoordinateImpl< DGtal::BigInteger, TOutput >::cast(), DGtal::Color::clamp(), LibBoard::ShapeList::clear(), cmpTranslatedFFT(), DGtal::deprecated::DigitalShapesIntersection< ShapeA, ShapeB >::DigitalShapesIntersection(), DGtal::deprecated::DigitalShapesMinus< ShapeA, ShapeB >::DigitalShapesMinus(), DGtal::deprecated::DigitalShapesUnion< ShapeA, ShapeB >::DigitalShapesUnion(), DGtal::deprecated::EuclideanShapesIntersection< ShapeA, ShapeB >::EuclideanShapesIntersection(), DGtal::deprecated::EuclideanShapesMinus< ShapeA, ShapeB >::EuclideanShapesMinus(), DGtal::deprecated::EuclideanShapesUnion< ShapeA, ShapeB >::EuclideanShapesUnion(), DGtal::Shortcuts< TKSpace >::getColorMap(), DGtal::ATSolver2D< TKSpace, TLinearAlgebra >::getOutputScalarFieldV0(), DGtal::ShortcutsGeometry< TKSpace >::getScalarsNormLoo(), DGtal::Shortcuts< TKSpace >::getZeroTickedColorMap(), incTest(), DGtal::DigitalShapesCSG< ShapeA, ShapeB >::intersection(), DGtal::EuclideanShapesCSG< ShapeA, ShapeB >::intersection(), main(), DGtal::Shortcuts< TKSpace >::makeGrayScaleImage(), DGtal::details::NumberTraitsImplFundamental< T >::max(), maxDiameter(), LibBoard::ShapeList::minDepth(), DGtal::functors::Max< T >::operator()(), DGtal::QuickHull< TKernel >::pickInitialSimplex(), DGtal::DigitalShapesCSG< ShapeA, ShapeB >::plus(), DGtal::EuclideanShapesCSG< ShapeA, ShapeB >::plus(), DGtal::RegularBinner< TQuantity >::RegularBinner(), LibBoard::Board::saveFIG(), testForwardBackwardFFT(), testInteger(), and testVisualTubularMesh().

rangeTest()

template<typename DSS >

bool rangeTest

(

const DSS &

dss

)

Test of the range services

Parameters

dss	an instance of DSS

Template Parameters

DSS	a model of arithmetical DSS, either naive or standard

Definition at line 204 of file testArithmeticalDSS.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "Range/Iterator services..." );
  trace.info() << dss << std::endl;
 
  if (dss.isValid())
    nbok++;
  nb++;
 
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  {//forward pass
    typedef typename DSS::ConstIterator I;
    BOOST_CONCEPT_ASSERT(( boost_concepts::ReadableIteratorConcept<I> ));
    BOOST_CONCEPT_ASSERT(( boost_concepts::BidirectionalTraversalConcept<I> ));
    bool res = true;
    int c = 0;
    for (I it = dss.begin(), itEnd = dss.end();
         ( (it != itEnd)&&(res)&&(c<100) );
         ++it, ++c)
      {
        trace.info() << *it << " ";
        if ( !dss(*it) )
          res = false;
      }
    trace.info() << " : " << c << " points " << std::endl;
    trace.info() << std::endl;
 
    if ( (res)&&(c == (dss.omega()+1))
         &&(*dss.begin() == dss.back())
         &&(*--dss.end() == dss.front()) )
      nbok++;
    nb++;
 
    trace.info() << "(" << nbok << "/" << nb << ") "
                 << std::endl;
  }
 
  {//backward pass
    typedef typename DSS::ConstReverseIterator I;
    bool res = true;
    int c = 0;
    for (I it = dss.rbegin(), itEnd = dss.rend();
         ( (it != itEnd)&&(res)&&(c<100) );
         ++it, ++c)
      {
        trace.info() << *it << " ";
        if ( !dss(*it) )
          res = false;
      }
    trace.info() << " : " << c << " points " << std::endl;
    trace.info() << std::endl;
 
    if ( (res)&&(c == (dss.omega()+1))
         &&(*dss.rbegin() == dss.front())
         &&(*--dss.rend() == dss.back()) )
      nbok++;
    nb++;
 
    trace.info() << "(" << nbok << "/" << nb << ") "
                 << std::endl;
  }
 
  trace.endBlock();
 
  return nbok == nb;
}

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

Referenced by main().

retractionTest()

template<typename DSS >

void retractionTest	(	const DSS &	dss,
		unsigned int &	nbok,
		unsigned int &	nb,
		bool	res = true
	)

Unit test of the retraction service

Parameters

dss	an instance of DSS

Template Parameters

DSS	a model of arithmetical DSS, either naive or standard

Parameters

nbok	(returned) number of passed tests
nb	(returned) number of tests
res	result of the retraction: 'true' if done, 'false' otherwise

Definition at line 360 of file testArithmeticalDSS.cpp.

{
  typedef typename DSS::Point Point;
 
  trace.info() << dss << std::endl;
  if (dss.isValid())
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  //local and modifiable copy
  DSS mdss = dss;
 
  //forward test
  Point first = mdss.back();
  trace.info() << "remove " << first << std::endl;
  if ( ( (mdss.retractBack())
         && (mdss.isValid())
         && (mdss(first) == false) ) == res )
    nbok++;
  nb++;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  if (res)
    {
      if ( (mdss.extendBack(first))
           && (mdss.isValid()) && (mdss == dss) )
        nbok++;
      nb++;
      trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
    }
 
  //backward test
  Point last = mdss.front();
  trace.info() << "remove " << last << std::endl;
  if ( ( (mdss.retractFront())
         && (mdss.isValid())
         && (mdss(last) == false) ) == res )
    nbok++;
  nb++;
  trace.info() << mdss << std::endl;
  trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
 
  if (res)
    {
      if ( (mdss.extendFront(last))
           && (mdss.isValid()) && (mdss == dss) )
        nbok++;
      nb++;
      trace.info() << "(" << nbok << "/" << nb << ") " << std::endl;
    }
 
}

References DGtal::Trace::info(), and DGtal::trace.

Referenced by updateTest().

testPatchCreatePattern()

bool testPatchCreatePattern

(

)

Definition at line 1333 of file testArithmeticalDSS.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock("Test patch bezoutVector/CreatePattern");
 
  typedef DGtal::ArithmeticalDSSFactory<DGtal::int32_t> Factory;
  typedef DGtal::ArithmeticalDSS<DGtal::int32_t> DSS8;
  typedef DSS8::Point Point;
  DSS8 dss = Factory::createPattern(DSS8::Point(0,0), DSS8::Point(-1,-3));
  nb++;
  nbok += (dss == DSS8(-3,-1,Point(0,0), Point(-1,-3), Point(0,0), Point(-1,-3), Point(-1,-1), Point(-1,-1)));
  
  dss = Factory::createPattern(DSS8::Point(0,0), DSS8::Point(10,-1));
  nb++;
  nbok += (dss == DSS8(-1,10, Point(0,0), Point(10,-1), Point(0,0), Point(10,-1), Point(1,-1), Point(1,-1)));
  
  trace.endBlock();
  
  return (nb == nbok);
  
}

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

Referenced by main().

unionComparisonTest()

template<typename TCoordinate , typename TInteger , unsigned short adjacency>

bool unionComparisonTest	(	int	modb,
		int	modx,
		unsigned int	nbtries
	)

Definition at line 1119 of file testArithmeticalDSS.cpp.

{
  typedef ArithmeticalDSS<TCoordinate,TInteger,adjacency> DSS;
  typedef typename DSS::DSL DSL;
  typedef typename DSS::Point Point;
  typedef typename DSS::Integer Integer;
  typedef typename DSS::Vector Vector;
 
  unsigned int nb = 0;
  unsigned int nbok = 0;
  unsigned int nbEasy = 0;
 
  DGtal::IntegerComputer<Integer> ic;
 
  trace.beginBlock("General random test results");
  trace.emphase() << "Adjacency: " << adjacency << std::endl;
  
  for ( unsigned int i = 0; i < nbtries; ++i )
    {
      // Pick up a random DSL slope
      Integer b( rand() % modb + 1 );
      Integer a( rand() % b +1);
      while(ic.gcd(a,b) !=1)
        a =rand()%b +1; // |a| < |b|
      
      // Pick-up random signs for a and b
      a = a*((rand()%2==0)?1:-1);
      b = b*((rand()%2==0)?1:-1);
 
      if ( ic.gcd( a, b ) == 1 )
        {
          
          for ( unsigned int j = 0; j < 5; ++j )
            {
              // Pick up the DSL intercept
              Integer mu = rand() % (2*modb);
              DSL baseDSL(a,b,-mu);
              
              for (Integer x = 0; x < 10; ++x )
                {
                  Integer elemMove = (b>0)?1:-1;
 
                  // modx modulates the length of the subsegments
                  // Pick up the beginning of the first subsegment
                  Integer x1 = rand() % modx;
                  // Pick up the end of the first subsegment
                  Integer x2 = x1 + (modx + (rand() % modx))*elemMove;
                  
                  /************************************************/
                  
                  // Connected DSSs: The beginning of the second
                  //subsegment is randomly set between x1 and x2 or just
                  //after x2. 
                  //Integer x3 = x1 + (rand() % (x2-x1+1))*elemMove;
 
                  // Disonnected DSSs: The beginning of the second subsegment is randomly set after x2. 
                  //Integer x3 = x2 + (rand() % (modb))*elemMove;
                  
                  // General Case
                  Integer x3 = x1 + (rand() % (2*modb))*elemMove;
 
                  // The length of the second segment is set to modx
                  Integer x4 = x3 + modx*elemMove;
                  
                  Integer y1,y2,y3,y4;
                  if(baseDSL.shift()[1] < 0)
                    {
                       y1 = ic.floorDiv(a*x1+mu,b);  y2 = ic.floorDiv(a*x2+mu,b);
                       y3 = ic.floorDiv(a*x3+mu,b);  y4 = ic.floorDiv(a*x4+mu,b);
                    }
                  else
                    {
                       y1 = ic.ceilDiv(a*x1+mu,b);  y2 = ic.ceilDiv(a*x2+mu,b);
                       y3 = ic.ceilDiv(a*x3+mu,b);  y4 = ic.ceilDiv(a*x4+mu,b);
                    }
                  
                  Point A,B,C,D;
                  DSL aDSL(baseDSL);
                  //Randomly switch a and b to cover cases where |a| > |b|
                  if(rand()%2)
                    {
                      aDSL = DSL(b,-a,-mu);
                      A = Point(-y1,x1); B = Point(-y2,x2);
                      C = Point(-y3,x3); D = Point(-y4,x4);
                    }
                  else
                    {
                      A = Point(x1,y1); B = Point(x2,y2);
                      C = Point(x3,y3); D = Point(x4,y4);
                    }
                  
                  // Computation of the parameters of the two segments
                  // using the subsegment algorithm of [Roussillon,
                  // 2014] 
                  
                  DSS DSS1(aDSL,A,B);
                  DSS DSS2(aDSL,C,D);
 
                  nb++;
                  // Computation of DSS1 \cup DSS2 using the union algorithm [Sivignon, 2014]
                  DSS DSSres = DSS1.computeUnion(DSS2);
                  
                  
                  // Compare the result with Arithmetical DSS recognition algorithm for easy cases
                  Vector dir;
                  if(abs(aDSL.a())<=abs(aDSL.b()))
                     dir = Vector(0,1);
                  else
                    dir = Vector(1,0);
 
                  if(aDSL.beforeOrEqual(C,B) || ic.dotProduct(C-B,dir)==0 ||  DGtal::ArithmeticalDSLKernel<TCoordinate,adjacency>::norm((C-B)[0], (C-B)[1])<=1 )
                    {
                      nbEasy++;
                      // Computation of DSS1 \cup DSS2 using the
                      // Arithmetical DSS algorithm: add points from B++
                      // until D
                      DSS DSSGroundTruth(DSS1);
                      if(aDSL.before(B,D)) // otherwise [CD] is included
                                           // in [AB]
                        {
                          typename DSS::ConstIterator itbegin = aDSL.begin(B);
                          typename DSS::ConstIterator itend = aDSL.end(D);
                          typename DSS::ConstIterator it = itbegin++;
                          while(it != itend)
                            {
                              DSSGroundTruth.extendFront(*it);
                              it++;
                            }
                        }
                      
                      if(DSSres != DSSGroundTruth)
                        {
                          
                          trace.info() << "DSS1 " << DSS1 << "\n" << "DSS2 " << DSS2 << std::endl; 
                          trace.info() << DSSres << std::endl;
                          trace.info() << DSSGroundTruth << std::endl;
                          trace.info() << "------------------\n";
                        }
                      nbok+=(DSSres == DSSGroundTruth)?1:0;
                      
                    }
                  else
                    { // for disconnected cases, check that all the leaning points of DSSres that are between A anb B or between C and D are in the DSL
                      
                      bool error = false;
                      if((aDSL.beforeOrEqual(DSSres.Uf(),B) && !aDSL.isInDSL(DSSres.Uf())) || (!aDSL.before(DSSres.Uf(),C) && !aDSL.isInDSL(DSSres.Uf()))) 
                        error = true;
                      if((aDSL.beforeOrEqual(DSSres.Ul(),B) && !aDSL.isInDSL(DSSres.Ul())) || (!aDSL.before(DSSres.Ul(),C) && !aDSL.isInDSL(DSSres.Ul()))) 
                        error = true;
                      if((aDSL.beforeOrEqual(DSSres.Lf(),B) && !aDSL.isInDSL(DSSres.Lf())) || (!aDSL.before(DSSres.Lf(),C) && !aDSL.isInDSL(DSSres.Lf()))) 
                        error = true;
                      if((aDSL.beforeOrEqual(DSSres.Ll(),B) && !aDSL.isInDSL(DSSres.Ll())) || (!aDSL.before(DSSres.Ll(),C) && !aDSL.isInDSL(DSSres.Ll()))) 
                        error = true;
                      
                      if(error || !DSSres.isValid() || DSSres==DSS(Point(0,0)))
                        {
                          trace.info() << "disconnected\n";
                          trace.info() << "DSS1 " << DSS1 << "\n" << "DSS2 " << DSS2 << std::endl; 
                          trace.info() << DSSres << std::endl;
                          trace.info() << "--------------------------------\n";
                        }
                      else
                        nbok++;
                      
                    }
                  
                  
                }
            }
          
        }
    }
  
  
  trace.info() << "(" << nbok << "/" << nb << ") "
               << nbEasy << " easy cases." << std::endl;
  trace.endBlock();
  return (nb==nbok);
}

References DGtal::Trace::beginBlock(), DGtal::IntegerComputer< TInteger >::ceilDiv(), DGtal::IntegerComputer< TInteger >::dotProduct(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::IntegerComputer< TInteger >::floorDiv(), DGtal::IntegerComputer< TInteger >::gcd(), DGtal::Trace::info(), and DGtal::trace.

unionTest()

bool unionTest

(

)

Definition at line 880 of file testArithmeticalDSS.cpp.

{
  unsigned int nb = 0;
  unsigned int nbok = 0;
  
  typedef DGtal::ArithmeticalDSS<DGtal::int32_t,DGtal::int32_t,8> DSS;
  typedef DSS::Point Point;
  
  trace.beginBlock("Testing union of two DSSs");
 
  // Different tests to cover all possible configurations
  
  //-------------------------------------------------
  //---------- Union is part of a DSL----------------
 
  // DSS1 included in DSS2
  
  trace.beginBlock("Simplest inclusion: DSS1 in DSS2");
  // octant 0
  trace.info() << "octant 0\n";
  DSS DSS1(1,2,Point(2,2),Point(6,4),Point(2,2),Point(6,4),Point(3,2),Point(5,3));
  DSS DSS2(3,5,Point(-2,-1),Point(9,6),Point(2,2),Point(7,5),Point(0,0),Point(5,3));
  DSS res=DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS2)?1:0;
  
  // octant 1
  trace.info() << "octant 1\n";
  DSS1 = DSS(2,1,Point(2,2),Point(4,6),Point(2,3),Point(3,5),Point(2,2),Point(4,6));
  assert(DSS1.isValid());
  DSS2 = DSS(5,3,Point(-1,-2),Point(6,9),Point(0,0),Point(3,5),Point(2,2),Point(5,7));
  assert(DSS2.isValid());
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS2)?1:0;
 
  // octant 2
  trace.info() << "octant 2\n";
  DSS1 = DSS(2,-1,Point(-2,2),Point(-4,6),Point(-2,2),Point(-4,6),Point(-2,3),Point(-3,5));
  assert(DSS1.isValid());
  DSS2 = DSS(5,-3,Point(1,-2),Point(-6,9),Point(-2,2),Point(-5,7),Point(0,0),Point(-3,5));
  assert(DSS2.isValid());
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS2)?1:0;
 
  // octant 3
  trace.info() << "octant 3\n";
  DSS1 = DSS(1,-2,Point(-2,2),Point(-6,4),Point(-3,2),Point(-5,3),Point(-2,2),Point(-6,4));
  assert(DSS1.isValid());
  DSS2 = DSS(3,-5,Point(2,-1),Point(-9,6),Point(0,0),Point(-5,3),Point(-2,2),Point(-7,5));
  assert(DSS2.isValid());
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS2)?1:0;
 
  // octant 4
  trace.info() << "octant 4\n";
  DSS1 = DSS(-1,-2,Point(-2,-2),Point(-6,-4),Point(-2,-2),Point(-6,-4),Point(-3,-2),Point(-5,-3));
  assert(DSS1.isValid());
  DSS2 = DSS(-3,-5,Point(2,1),Point(-9,-6),Point(-2,-2),Point(-7,-5),Point(0,0),Point(-5,-3));
  assert(DSS2.isValid());
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS2)?1:0;
 
  // octant 5 - take octant3 - DSS(a,b...) -> DSS(-a,b...) + Point(x,y) -> Point(x,-y) + inverse lower and upper leaning points
 
  trace.endBlock();
  
  // DSS2 included in DSS1 + see unionComparisonTest below
  trace.beginBlock("Simplest inclusion: DSS2 in DSS1");
  // octant 0
  trace.info() << "octant 0\n";
  DSS1 = DSS(3,5,Point(-2,-1),Point(9,6),Point(2,2),Point(7,5),Point(0,0),Point(5,3));
  DSS2 = DSS(1,2,Point(2,2),Point(6,4),Point(2,2),Point(6,4),Point(3,2),Point(5,3));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS1)?1:0;
  
  trace.endBlock();
  
  // DSS2 belongs to DSS1's supporting DSL
 
  trace.beginBlock("DSS2 belongs to DSS1's supporting DSL");
  // octant 0
  trace.info() << "octant 0 - no new leaning points\n";
  DSS1 = DSS(3,7,Point(1,3),Point(12,7),Point(3,4),Point(10,7),Point(5,4),Point(12,7));
  DSS2 = DSS(1,2,Point(14,8),Point(16,9),Point(15,9),Point(15,9),Point(14,8),Point(16,9));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(3,7,Point(1,3),Point(16,9),Point(3,4),Point(10,7),Point(5,4),Point(12,7)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.info() << "octant 0 - new leaning points in DSS2\n";
  DSS1 = DSS(3,7,Point(1,3),Point(10,7),Point(3,4),Point(10,7),Point(5,4),Point(5,4));
  DSS2 = DSS(1,2,Point(12,7),Point(17,10),Point(13,8),Point(17,10),Point(12,7),Point(16,9));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(3,7,Point(1,3),Point(17,10),Point(3,4),Point(17,10),Point(5,4),Point(12,7)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  
  trace.info() << "octant 0 - new leaning points between DSS1 and DSS2\n";
  DSS1 = DSS(3,7,Point(1,3),Point(10,7),Point(3,4),Point(10,7),Point(5,4),Point(5,4));
  DSS2 = DSS(1,2,Point(13,8),Point(15,9),Point(13,8),Point(15,9),Point(14,8),Point(14,8));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(3,7,Point(1,3),Point(15,9),Point(3,4),Point(10,7),Point(5,4),Point(12,7)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  
  trace.endBlock();
  
  // DSS1 belongs to DSS2 supporting DSL
 
  // DSS1 and DSS2 connected and union is part of a DSL -> see
  // unionComparisonTest below
  
  // DSS1 and DSS2 not connected but easy case and union is part of a
  // DSL -> see unionComparisonTest below
 
  trace.beginBlock("Not connected but easy case");
 
  trace.info() << "octant 2";
  DSS1 = DSS(1,5,Point(0,1),Point(5,2),Point(1,2),Point(1,2),Point(0,1),Point(5,2));
  DSS2 = DSS(1,4,Point(9,2),Point(14,3),Point(11,3),Point(11,3),Point(10,2),Point(14,3));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(1,10,Point(0,1),Point(14,3),Point(1,2),Point(11,3),Point(0,1),Point(10,2)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.endBlock();
  
  // DSS1 and DSS2 not connected and union is part of a DSL
  
  trace.beginBlock("Not connected case");
 
  trace.info() << "octant 0\n";
  DSS1 = DSS(1,5,Point(0,1),Point(5,2),Point(1,2),Point(1,2),Point(0,1),Point(5,2));
  DSS2 = DSS(1,4,Point(9,2),Point(14,3),Point(11,3),Point(11,3),Point(10,2),Point(14,3));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(1,10,Point(0,1),Point(14,3),Point(1,2),Point(11,3),Point(0,1),Point(10,2)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  DSS1 = DSS(1,6,Point(0,1),Point(6,2),Point(1,2),Point(1,2),Point(0,1),Point(6,2));
  DSS2 = DSS(0,1,Point(13,3),Point(18,3),Point(13,3),Point(18,3),Point(13,3),Point(18,3));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(1,9,Point(0,1),Point(18,3),Point(1,2),Point(10,3),Point(0,1),Point(18,3)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
 
  trace.info() << "octant 2\n";
 
  DSS1 = DSS(6,-1,Point(-1,0),Point(-2,6),Point(-2,1),Point(-2,1),Point(-1,0),Point(-2,6));
  DSS2 = DSS(1,0,Point(-3,13),Point(-3,18),Point(-3,13),Point(-3,18),Point(-3,13),Point(-3,18));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(9,-1,Point(-1,0),Point(-3,18),Point(-2,1),Point(-3,10),Point(-1,0),Point(-3,18)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  
 
 
  trace.endBlock();
 
  //-------------------------------------------------
  //---------- Union is not part of a DSL -----------
 
  trace.beginBlock("Union is not part of a DSL");
  
  // DSS1 and DSS2 not in the same octant
  trace.info() << "DSS1 and DSS2 are not in the same octant\n";
  
  DSS1 = DSS(1,3,Point(0,0),Point(3,1),Point(0,0),Point(3,1),Point(2,0),Point(2,0));
  DSS2 = DSS(1,-3,Point(6,2),Point(9,1),Point(6,2),Point(9,1),Point(8,2),Point(8,2));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(Point(0,0)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  
  // DSS1 and DSS2 connected and union is not part of a DSL
  trace.info() << "DSS1 and DSS2 are in the same octant and connected\n";
  
  DSS1 = DSS(1,3,Point(0,0),Point(4,2),Point(1,1),Point(4,2),Point(0,0),Point(3,1));
  DSS2 = DSS(1,5,Point(4,2),Point(9,3),Point(4,2),Point(9,3),Point(8,2),Point(8,2));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(Point(0,0)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  
 
  // DSS1 and DSS2 not connected but easy case and union is not part of a DSL
  trace.info() << "DSS1 and DSS1 are in the same octant, not connected but easy case anyway\n";
  
  DSS1 = DSS(-3,-1,Point(0,0),Point(-2,-5),Point(0,0),Point(-1,-3),Point(-1,-1),Point(-2,-4));
  DSS2 = DSS(-3,-1,Point(-2,-8),Point(-3,-11),Point(-2,-10),Point(-2,-10),Point(-2,-8),Point(-3,-11));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(Point(0,0)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  
  // DSS1 and DSS2 not connected and union is not part of a DSL
  trace.info() << "DSS1 and DSS2 are in the same octant but not connected\n";
 
  DSS1 = DSS(-3,-1,Point(0,0),Point(-2,-5),Point(0,0),Point(-1,-3),Point(-1,-1),Point(-2,-4));
  DSS2 = DSS(-3,-1,Point(-5,-8),Point(-6,-11),Point(-5,-10),Point(-5,-10),Point(-5,-8),Point(-6,-11));
  res = DSS1.computeUnion(DSS2);
  nb++;
  nbok +=(res==DSS(Point(0,0)))?1:0;
  trace.info() << "(" << nbok << "/" << nb << ") "
               << std::endl;
  
 
  trace.endBlock();
  
  return (nb==nbok);
  
}

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

Referenced by main().

updateTest()

template<typename DSS >

bool updateTest

(

)

Test of the update services

Template Parameters

DSS	a model of arithmetical DSS, either naive or standard

Definition at line 423 of file testArithmeticalDSS.cpp.

{
  typedef typename DSS::Point Point;
  typedef typename DSS::Vector Vector;
 
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "Extension services..." );
 
  if (nbok == nb)
    {
      trace.info() << "not connected point" << std::endl;
      DSS dss(Point(0,0), Point(8,5), true);
      extensionTest( dss, Point(9,7), Point(-2,1), nbok, nb );
    }
 
  if (nbok == nb)
    {
      trace.info() << "not compatible second step" << std::endl;
      DSS dss(Point(0,0), Point(1,1), true);
      extensionTest( dss, Point(0,2), Point(-1,1), nbok, nb );
    }
 
  if (nbok == nb)
    {
      trace.info() << "a third step" << std::endl;
      DSS dss(Point(0,0), Point(2,1), true);
      extensionTest( dss, Point(2,2), Point(0,1), nbok, nb );
    }
 
  if (nbok == nb)
    {
      trace.info() << "strongly exterior" << std::endl;
      DSS dss(Point(0,0), Point(8,5), true);
      extensionTest( dss, Point(9,6), Point(-1,0), nbok, nb );
    }
 
  if (nbok == nb)
    {
      trace.info() << "confounded points" << std::endl;
      DSS dss(Point(0,0), Point(8,5), true);
      extensionTest( dss, Point(8,5), Point(0,0), nbok, nb, 9 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "strongly interior points" << std::endl;
      DSS dss0(Point(0,0), Point(8,5), true);
      DSS dss(5, 8, Point(-2,-2), Point(8,5),
              dss0.Uf(), dss0.Ul(),
              dss0.Lf(), dss0.Ll() );
      extensionTest( dss, Point(9,5), Point(-3,-2), nbok, nb, 9 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "weakly interior points on the left" << std::endl;
      DSS dss0(Point(0,0), Point(8,5), true);
      Point newPointToBack = dss0.Lf()-Vector(8,5);
      Point newPointToFront = dss0.Ul()+Vector(8,5);
      DSS dss(5, 8,
              newPointToBack+dss0.steps().second,
              newPointToFront-dss0.steps().second,
              dss0.Uf(), dss0.Ul(),
              dss0.Lf(), dss0.Ll()+Vector(8,5) );
      extensionTest( dss, newPointToFront, newPointToBack, nbok, nb, 5 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "weakly exterior points on the left" << std::endl;
      DSS dss0(Point(0,0), Point(8,5), true);
      Point newPointToBack = dss0.Uf()+dss0.shift()-Vector(8,5);
      Point newPointToFront = dss0.Ll()-dss0.shift()+Vector(8,5);
      DSS dss(5, 8,
              newPointToBack+dss0.steps().second,
              newPointToFront-dss0.steps().second,
              dss0.Uf(), dss0.Ul(),
              dss0.Lf()-Vector(8,5), dss0.Ll() );
      extensionTest( dss, newPointToFront, newPointToBack, nbok, nb, 7 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "weakly interior points on the right" << std::endl;
      DSS dss0(Point(0,0), Point(8,5), true);
      Point newPointToBack = dss0.Uf()-Vector(8,5);
      Point newPointToFront = dss0.Ll()+Vector(8,5);
      DSS dss(5, 8,
              newPointToBack+dss0.steps().first,
              newPointToFront-dss0.steps().first,
              dss0.Uf(), dss0.Ul(),
              dss0.Lf()-Vector(8,5), dss0.Ll() );
      extensionTest( dss, newPointToFront, newPointToBack, nbok, nb, 6 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "weakly exterior points on the right" << std::endl;
      DSS dss0(Point(0,0), Point(8,5), true);
      Point newPointToBack = dss0.Lf()-Vector(8,5)-dss0.shift();
      Point newPointToFront = dss0.Ul()+Vector(8,5)+dss0.shift();
      DSS dss(5, 8,
              newPointToBack+dss0.steps().first,
              newPointToFront-dss0.steps().first,
              dss0.Uf(), dss0.Ul(),
              dss0.Lf(), dss0.Ll()+Vector(8,5) );
      extensionTest( dss, newPointToFront, newPointToBack, nbok, nb, 8 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "first step" << std::endl;
      DSS dss( Point(0,0), Point(0,0) );
      extensionTest( dss, Point(1,0), Point(-1,0), nbok, nb, 1 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "first step repetition" << std::endl;
      DSS dss(Point(0,0), Point(1,0), true);
      extensionTest( dss, Point(2,0), Point(-1,0), nbok, nb, 2 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "second step (above)" << std::endl;
      DSS dss0(Point(0,0), Point(2,1), true);
      DSS dss(Point(0,0), Point(2,1) - dss0.steps().second);
      Point newPointToBack = Point(0,0) - dss0.steps().second;
      extensionTest( dss, Point(2,1), newPointToBack, nbok, nb, 3 );
    }
 
  if (nbok == nb)
    {
      trace.info() << "second step (below)" << std::endl;
      DSS dss0a(Point(0,0), Point(2,-1), true);
      DSS dss0b(Point(0,0), Point(2,1), true);
      DSS dss(Point(0,0), Point(2,-1) - dss0a.steps().first);
      Point newPointToBack = Point(0,0) - dss0a.steps().first;
      extensionTest( dss, Point(2,-1), newPointToBack, nbok, nb, 4 );
    }
 
  trace.endBlock();
 
  if (nbok == nb)
    {
      trace.beginBlock ( "Retraction services..." );
 
      {
        trace.info() << "upper leaning points" << std::endl;
        DSS dss(Point(0,0), Point(8,5), true);
        retractionTest( dss, nbok, nb );
      }
 
      if (nbok == nb)
        {
          trace.info() << "lower leaning points" << std::endl;
          DSS dss0(Point(0,0), Point(8,5), true);
          Point first = dss0.Lf();
          Point last = dss0.Lf() + Vector(8,5);
          DSS dss(5, 8, first, last,
                  Point(8,5), Point(8,5),
                  first, last );
          retractionTest( dss, nbok, nb );
        }
 
      if (nbok == nb)
        {
          trace.info() << "upper leaning points (repetitions)" << std::endl;
          DSS dss(Point(0,0), Point(16,10), true);
          retractionTest( dss, nbok, nb );
        }
 
      if (nbok == nb)
        {
          trace.info() << "lower leaning points (repetitions)" << std::endl;
          DSS dss0(Point(0,0), Point(16,10), true);
          Point first = dss0.Lf();
          Point last = dss0.Lf() + Vector(16,10);
          DSS dss(5, 8, first, last,
                  Point(8,5), Point(16,10),
                  first, last );
          retractionTest( dss, nbok, nb );
        }
 
      if (nbok == nb)
        {
          trace.info() << "no change" << std::endl;
          DSS dss0(Point(0,0), Point(21,13), true);
          typename DSS::ConstIterator itb = dss0.begin();
          --itb; --itb; --itb;
          typename DSS::ConstIterator ite = dss0.end();
          ++ite; ++ite; ++ite;
          DSS dss(dss0.a(), dss0.b(), *itb, *ite,
                  dss0.Uf(), dss0.Ul(), dss0.Lf(), dss0.Ll() );
          retractionTest( dss, nbok, nb );
        }
 
      if (nbok == nb)
        {
          trace.info() << "one point" << std::endl;
          DSS dss(Point(0,0), Point(0,0), true);
          retractionTest( dss, nbok, nb, false );
        }
 
      if (nbok == nb)
        {
          trace.info() << "two points" << std::endl;
          DSS dss(Point(0,0), Point(1,0), true);
          retractionTest( dss, nbok, nb );
        }
 
      if (nbok == nb)
        {
          trace.info() << "from two steps to one step" << std::endl;
          DSS dss(Point(0,0), Point(1,1), true);
          retractionTest( dss, nbok, nb );
        }
 
 
      trace.endBlock();
    }
 
  return nbok == nb;
}

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

Referenced by main().