testStabbingCircleComputer.cpp File Reference

Functions for testing class StabbingCircleComputer. More...

#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/kernel/SpaceND.h"
#include "DGtal/kernel/domains/HyperRectDomain.h"
#include "DGtal/topology/KhalimskySpaceND.h"
#include "DGtal/shapes/ShapeFactory.h"
#include "DGtal/shapes/Shapes.h"
#include "DGtal/topology/helpers/Surfaces.h"
#include "DGtal/shapes/GaussDigitizer.h"
#include "DGtal/geometry/curves/GridCurve.h"
#include "DGtal/geometry/curves/CBidirectionalSegmentComputer.h"
#include "DGtal/geometry/curves/StabbingCircleComputer.h"
#include "DGtal/geometry/curves/SegmentComputerUtils.h"
#include "DGtal/geometry/curves/GreedySegmentation.h"
#include "DGtal/geometry/curves/SaturatedSegmentation.h"
#include "DGtal/io/boards/Board2D.h"
#include "DGtal/io/boards/CDrawableWithBoard2D.h"
#include "ConfigTest.h"

Include dependency graph for testStabbingCircleComputer.cpp:

Go to the source code of this file.

Functions
template<typename TKSpace , typename Integer >
void	ballGenerator (const TKSpace &aKSpace, GridCurve< TKSpace > &aGC, const Integer &aR, const bool &aFlagIsCW)
void	testStabbingCircleComputerConceptChecking ()
template<typename TCurve >
bool	drawingTestStabbingCircleComputer (const TCurve &curve, const string &suffix)
template<typename TCurve >
bool	testStabbingCircleComputer (const TCurve &curve)
bool	testRecognition ()
template<typename TCurve >
bool	testSegmentation (const TCurve &curve)
int	main (int argc, char **argv)

Detailed Description

Functions for testing class StabbingCircleComputer.

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

2011/09/26

This file is part of the DGtal library.

Definition in file testStabbingCircleComputer.cpp.

Function Documentation

ballGenerator()

template<typename TKSpace , typename Integer >

void ballGenerator	(	const TKSpace &	aKSpace,
		GridCurve< TKSpace > &	aGC,
		const Integer &	aR,
		const bool &	aFlagIsCW
	)

Definition at line 80 of file testStabbingCircleComputer.cpp.

{
 
  // Types
  typedef TKSpace KSpace;  
  typedef typename KSpace::SCell SCell;
  typedef typename KSpace::Space Space;
  typedef typename Space::Point Point;
  
  MyBallPredicate<Point,Integer> predicate(aR);
  try 
    {
      // Extracts shape boundary
      SurfelAdjacency<KSpace::dimension> SAdj( true );
      SCell bel = Surfaces<KSpace>::findABel( aKSpace, predicate, 10000 );
      // Getting the consecutive surfels of the 2D boundary
      std::vector<Point> points, points2;
      Surfaces<KSpace>::track2DBoundaryPoints( points,  aKSpace, SAdj, predicate, bel );
      //counter-clockwise oriented by default
      if (aFlagIsCW)
        {
          points2.assign( points.rbegin(), points.rend() );
          aGC.initFromVector(points2); 
        } 
      else 
        {
          aGC.initFromVector(points); 
        }
    }
  catch ( InputException& e )
    {
      std::cerr << " "
                << " error in finding a bel." << std::endl;
    }
}

References DGtal::GridCurve< TKSpace >::initFromVector().

Referenced by main().

drawingTestStabbingCircleComputer()

template<typename TCurve >

bool drawingTestStabbingCircleComputer	(	const TCurve &	curve,
		const string &	suffix
	)

Definition at line 133 of file testStabbingCircleComputer.cpp.

{
 
  typedef typename TCurve::IncidentPointsRange Range; //range
  Range r = curve.getIncidentPointsRange(); //range
 
  {
    typedef typename Range::ConstIterator ConstIterator; //iterator
    StabbingCircleComputer<ConstIterator> s;
    longestSegment(s,r.begin(),r.end()); 
 
    Board2D board; 
    board << r << s; 
    std::stringstream ss; 
    ss << "StabbingCircleComputerDrawingTest" << suffix << ".eps"; 
    board.saveEPS(ss.str().c_str()); 
  }
 
  {
    typedef typename Range::ConstReverseIterator ConstReverseIterator; //iterator
    StabbingCircleComputer<ConstReverseIterator> s;
    longestSegment(s,r.rbegin(),r.rend()); 
 
    Board2D board;
    board << r << s;       
    std::stringstream ss; 
    ss << "StabbingCircleComputerDrawingTest" << suffix << "2.eps"; 
    board.saveEPS(ss.str().c_str()); 
  }
    
  return true; 
}

References DGtal::longestSegment(), and LibBoard::Board::saveEPS().

Referenced by main().

main()

int main	(	int	argc,
		char **	argv
	)

Definition at line 407 of file testStabbingCircleComputer.cpp.

{
  trace.beginBlock ( "Testing class StabbingCircleComputer" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;
 
  bool res; 
  
  {//concept checking
    testStabbingCircleComputerConceptChecking();
  }
  
  {//basic operations
    typedef KhalimskySpaceND<2,int> KSpace;
    typedef KSpace::Space::Point Point; 
    KSpace kspace(Point::diagonal(-10),Point::diagonal(10),true); 
    GridCurve<KSpace> c, rc; 
    ballGenerator(kspace,c,6,false); 
    ballGenerator(kspace,rc,6,true); 
 
    res = testStabbingCircleComputer(c)
  && drawingTestStabbingCircleComputer(c, "CCW")
  && drawingTestStabbingCircleComputer(rc, "CW"); 
  }
  
  {//recognition
    res = res && testRecognition();
  }
  
  {//segmentations
    std::string filename = testPath + "samples/sinus2D4.dat";
    ifstream instream; // input stream
    instream.open (filename.c_str(), ifstream::in);
    
    typedef KhalimskySpaceND<2,int> KSpace; 
    GridCurve<KSpace> c; //grid curve
    c.initFromVectorStream(instream);
    
    res = res && testSegmentation(c); 
  }
  
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}

References ballGenerator(), DGtal::Trace::beginBlock(), drawingTestStabbingCircleComputer(), DGtal::Trace::emphase(), DGtal::Trace::endBlock(), DGtal::Trace::info(), DGtal::GridCurve< TKSpace >::initFromVectorStream(), testRecognition(), testSegmentation(), testStabbingCircleComputer(), testStabbingCircleComputerConceptChecking(), and DGtal::trace.

testRecognition()

bool testRecognition

(

)

Recogition of randomly generated digital circles

Definition at line 262 of file testStabbingCircleComputer.cpp.

{
  typedef KhalimskySpaceND<2,int64_t> KSpace;
  //Note: int64_t is enough for radii less than 200
  typedef KSpace::Space Space;  
  typedef Space::Point Point;
  
  unsigned int nbok = 0;
  unsigned int nb = 0;
 
  trace.beginBlock ( "Recognition" );
  bool flag=true;
    
  for (unsigned int i = 1; i < 200 && flag; ++i)
  {
    int radius = i; 
    KSpace kspace( Point::diagonal(-2*radius), Point::diagonal(2*radius), true ); 
    GridCurve<KSpace> c(kspace); 
    ballGenerator<KSpace>( kspace, c, radius, ((i%2)==0) ); 
    trace.info() << " #ball c(0,0) r=" << radius
                 << " cw=" << ((i%2)==0) << endl; 
    
    //range
    typedef GridCurve<KSpace>::IncidentPointsRange Range; 
    Range r = c.getIncidentPointsRange();
    
    //recognition
    typedef Range::ConstIterator ConstIterator; //iterator
    StabbingCircleComputer<ConstIterator> s;
    longestSegment(s,r.begin(),r.end()); 
 
    if (s.end() != r.end())
    {
      trace.info()<< "Complete circle not recognized"<<std::endl;
      flag=false;
    }
    
    //checking if the circle is separating
    typedef CircleFrom3Points<KSpace::Point> Circle;
    typedef functors::Point2ShapePredicate<Circle,false,true> FirstInCirclePred;
    typedef functors::Point2ShapePredicate<Circle,true,true>  SecondInCirclePred;
    for (ConstIterator it = s.begin(); ((it != s.end()) && flag) ; ++it)
    {
      FirstInCirclePred p1( s.getSeparatingCircle() ); 
      SecondInCirclePred p2( s.getSeparatingCircle() ); 
      flag = ( p1(it->first)&&p2(it->second) ); 
      if (!flag)
      {
        trace.info() << s.getSeparatingCircle() << " "
                     << it->first << " "
                     << it->second << std::endl;
      }
    }
   
    //conclusion
    nbok += flag ? 1 : 0; 
    nb++;
  }
 
  trace.endBlock();
  
  trace.info() << "(" << nbok << "/" << nb << ") " << endl;
  return nbok == nb;
}

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

Referenced by main().

testSegmentation()

template<typename TCurve >

bool testSegmentation

(

const TCurve &

curve

)

Segmentations

Definition at line 331 of file testStabbingCircleComputer.cpp.

{
 
  typedef typename TCurve::IncidentPointsRange Range; //range
  Range r = curve.getIncidentPointsRange(); //range
  
  typedef typename Range::ConstIterator ConstIterator; //iterator
  typedef StabbingCircleComputer<ConstIterator> SegmentComputer; //segment computer
  
  unsigned int nbok = 0;
  unsigned int nb = 0;  
 
  trace.beginBlock ( "Greedy segmentation" );
  {
    typedef GreedySegmentation<SegmentComputer> Segmentation;
    Segmentation theSegmentation( r.begin(), r.end(), SegmentComputer() );
    
    Board2D board; 
    board << r; 
      
    typename Segmentation::SegmentComputerIterator it = theSegmentation.begin();
    typename Segmentation::SegmentComputerIterator itEnd = theSegmentation.end();
    unsigned int n = 0; 
    unsigned int suml = 0; 
    for ( ; it != itEnd; ++it, ++n) {
      board << SetMode(SegmentComputer().className(), "Sector")
                << (*it); 
      for (ConstIterator i = it->begin(); i != it->end(); ++i)
        suml += 1; 
    }
    
    board.saveSVG("StabbingCircleComputerGreedySegmentationTest.svg", Board2D::BoundingBox, 5000 ); 
 
    trace.info() << r.size() << ";" << n << ";" << suml << endl;
    //comparison with the results given by another program
    bool flag = ((r.size()==85)&&(n==6)&&(suml==90)&&((r.size()+n-1)==suml)); 
    nbok += flag ? 1 : 0; 
    nb++;
  }
  trace.endBlock();
 
  trace.beginBlock ( "Saturated segmentation" );
  {
    typedef SaturatedSegmentation<SegmentComputer> Segmentation;
    Segmentation theSegmentation( r.begin(), r.end(), SegmentComputer() );
    theSegmentation.setMode("Last"); 
    
    Board2D board; 
    board << curve; 
    
    typename Segmentation::SegmentComputerIterator it = theSegmentation.begin();
    typename Segmentation::SegmentComputerIterator itEnd = theSegmentation.end();
    unsigned int n = 0; 
    unsigned int suml = 0; 
    for ( ; it != itEnd; ++it, ++n) {
      board << SetMode(SegmentComputer().className(), "Annulus")
                << (*it); 
      for (ConstIterator i = it->begin(); i != it->end(); ++i)
        suml += 1; 
    }
    
    board.saveSVG("StabbingCircleComputerSaturatedSegmentationTest.svg", Board2D::BoundingBox, 5000 ); 
 
    trace.info() << r.size() << ";" << n << ";" << suml << endl;
    //comparison with the results given by another program
    nbok += ((r.size()==85)&&(n==20)&&(suml==326)) ? 1 : 0; 
    nb++;
  }
  trace.endBlock();
  
  trace.info() << "(" << nbok << "/" << nb << ") " << endl;
  return (nbok == nb);
}

References DGtal::SaturatedSegmentation< TSegmentComputer >::begin(), DGtal::Trace::beginBlock(), DGtal::SaturatedSegmentation< TSegmentComputer >::end(), DGtal::Trace::endBlock(), DGtal::Trace::info(), LibBoard::Board::saveSVG(), DGtal::SaturatedSegmentation< TSegmentComputer >::setMode(), and DGtal::trace.

Referenced by main().

testStabbingCircleComputer()

template<typename TCurve >

bool testStabbingCircleComputer

(

const TCurve &

curve

)

Basic methods

Definition at line 170 of file testStabbingCircleComputer.cpp.

{
 
  typedef typename TCurve::IncidentPointsRange Range; //range
  typedef typename Range::ConstIterator ConstIterator; //iterator
  typedef typename Range::ConstReverseIterator ConstReverseIterator; //reverse iterator
 
  unsigned int nbok = 0;
  unsigned int nb = 0;
  
  trace.beginBlock ( "Constructors, copy, assignement" );
  {
    Range r = curve.getIncidentPointsRange(); //range
 
    StabbingCircleComputer<ConstIterator> s1, s2, s3;
    longestSegment(s2, r.begin(), r.end()); 
    longestSegment(s3, r.begin()+1, r.end()); 
    StabbingCircleComputer<ConstIterator> s4(s2); 
    StabbingCircleComputer<ConstIterator> s5(s3);
    s3 = s1; 
    
    trace.info() << s1.isValid() << s1 << endl; 
    trace.info() << s2.isValid() << s2 << endl; 
    trace.info() << s3.isValid() << s3 << endl; 
    trace.info() << s4.isValid() << s4 << endl; 
    trace.info() << s5.isValid() << s5 << endl; 
 
    bool myFlag = (!s1.isValid())&&(!s3.isValid())
    &&(s2.isValid())&&(s4.isValid())&&(s5.isValid())
    &&(s2 == s4)&&(s2 != s5)&&(s2 != s1)
    &&(s3 != s5)&&(s1 == s3);
 
    nbok += myFlag ? 1 : 0; 
    nb++;
  }
  trace.endBlock();
    
  
  trace.beginBlock ( "Extension operations" );
  {
    Range r = curve.getIncidentPointsRange(); //range
 
    StabbingCircleComputer<ConstIterator> s, t;
 
    trace.info() << "forward extension " << endl; 
    
    ConstIterator itBegin (r.begin()); 
    ConstIterator itEnd (r.end()); 
 
    s.init( itBegin );
    while ( (s.end() != itEnd) && (s.isExtendableFront()) && (s.extendFront()) ) {}
    trace.info() << s << endl; 
 
    ConstIterator itLast (s.end()); --itLast;
      
    t.init( itLast ); 
    while ( (t.begin() != itBegin) && (t.extendBack()) ) {}
    trace.info() << t << endl; 
    
    trace.info() << "backward extension " << endl; 
      
    typename StabbingCircleComputer<ConstIterator>::Reverse rs = s.getReverse(); 
    ConstReverseIterator ritBegin ( s.end() ); 
    ConstReverseIterator ritEnd ( itBegin ); 
      
    rs.init( ritBegin );
    while ( (rs.end() != ritEnd) && (rs.isExtendableFront()) && (rs.extendFront()) ) {}
    trace.info() << rs << endl; 
    
    ConstReverseIterator ritLast (rs.end()); --ritLast;
      
    typename StabbingCircleComputer<ConstIterator>::Reverse rt = t.getReverse(); 
    rt.init( ritLast ); 
    while ( (rt.begin() != ritBegin) && (rt.extendBack()) ) {}
    trace.info() << rt << endl; 
    
    trace.info() << "comparison... " << endl; 
    bool myFlag = (s == t)
                      &&(rs == rt); 
 
    nbok += myFlag ? 1 : 0; 
    nb++;
  }
  trace.endBlock();
 
  trace.info() << "(" << nbok << "/" << nb << ") " << endl;
  return nbok == nb;
}

References DGtal::StabbingCircleComputer< TConstIterator >::begin(), DGtal::Trace::beginBlock(), DGtal::StabbingCircleComputer< TConstIterator >::end(), DGtal::Trace::endBlock(), DGtal::StabbingCircleComputer< TConstIterator >::extendBack(), DGtal::StabbingCircleComputer< TConstIterator >::extendFront(), DGtal::StabbingCircleComputer< TConstIterator >::getReverse(), DGtal::Trace::info(), DGtal::StabbingCircleComputer< TConstIterator >::init(), DGtal::StabbingCircleComputer< TConstIterator >::isExtendableFront(), DGtal::StabbingCircleComputer< TConstIterator >::isValid(), DGtal::longestSegment(), and DGtal::trace.

Referenced by main().

testStabbingCircleComputerConceptChecking()

void testStabbingCircleComputerConceptChecking

(

)

Definition at line 120 of file testStabbingCircleComputer.cpp.

{
   typedef std::pair<PointVector<2,int>, PointVector<2,int> > Pair; 
   typedef std::vector<Pair>::const_iterator ConstIterator; 
   typedef StabbingCircleComputer<ConstIterator> GeomDSS; 
   BOOST_CONCEPT_ASSERT(( concepts::CDrawableWithBoard2D<GeomDSS> ));
   BOOST_CONCEPT_ASSERT(( concepts::CBidirectionalSegmentComputer<GeomDSS> ));
}

Referenced by main().