testFrechetShortcut.cpp

Go to the documentation of this file.

#include <iostream>
#include <iterator>
#include <cstdio>
#include <cmath>
#include <fstream>
#include <vector>

#include "DGtal/base/Common.h"
#include "DGtal/base/Exceptions.h"
#include "DGtal/kernel/SpaceND.h"

#include "DGtal/kernel/domains/HyperRectDomain.h"
#include "DGtal/geometry/curves/FrechetShortcut.h"
#include "DGtal/io/boards/Board2D.h"

#include "DGtal/io/boards/CDrawableWithBoard2D.h"
#include "DGtal/geometry/curves/CForwardSegmentComputer.h"
#include "DGtal/helpers/StdDefs.h"

#include "DGtal/geometry/curves/GreedySegmentation.h"



using namespace std;
using namespace DGtal;
using namespace LibBoard;
using namespace Z2i;

// Functions for testing class FrechetShortcut.

bool testFrechetShortcut()
{
  unsigned int nbok = 0;
  unsigned int nb = 0;

  typedef PointVector<2,int> Point;
  typedef std::vector<Point>::iterator Iterator;
  typedef FrechetShortcut<Iterator,int> Shortcut;

  std::vector<Point> contour;
  contour.push_back(Point(0,0));
  contour.push_back(Point(1,0));
  contour.push_back(Point(2,0));
  contour.push_back(Point(3,0));
  contour.push_back(Point(4,0));
  contour.push_back(Point(5,0));
  contour.push_back(Point(6,0));
  contour.push_back(Point(7,0));
  contour.push_back(Point(7,1));
  contour.push_back(Point(6,1));
  contour.push_back(Point(5,1));
  contour.push_back(Point(4,1));
  contour.push_back(Point(3,1));
  contour.push_back(Point(2,1));
  contour.push_back(Point(3,2));
  contour.push_back(Point(4,2));
  contour.push_back(Point(5,2));
  contour.push_back(Point(6,2));
  contour.push_back(Point(7,2));
  contour.push_back(Point(8,2));
  contour.push_back(Point(9,2));

  trace.beginBlock ( "Testing block ..." );

  Shortcut s(5);
  s.init(contour.begin());

  trace.info() << s << std::endl;

  while ( (s.end() != contour.end())
    &&(s.extendFront()) ) {}

  trace.info() << s << std::endl;


  trace.endBlock();

  return nbok == nb;
}



void testFrechetShortcutConceptChecking()
{
  typedef PointVector<2,int> Point;
  typedef std::vector<Point>::const_iterator ConstIterator;
  typedef FrechetShortcut<ConstIterator,int> Shortcut;
  BOOST_CONCEPT_ASSERT(( concepts::CDrawableWithBoard2D<Shortcut> ));
  BOOST_CONCEPT_ASSERT(( concepts::CForwardSegmentComputer<Shortcut> ));
}

bool testSegmentation()
{
  unsigned int nbok = 0;
  unsigned int nb = 0;

  typedef PointVector<2,int> Point;
  //typedef std::vector<Point>::iterator Iterator;
  //typedef FrechetShortcut<Iterator,int> SegmentComputer;

  std::vector<Point> contour;
  contour.push_back(Point(0,0));
  contour.push_back(Point(1,0));
  contour.push_back(Point(2,0));
  contour.push_back(Point(3,0));
  contour.push_back(Point(4,0));
  contour.push_back(Point(5,0));
  contour.push_back(Point(6,0));
  contour.push_back(Point(7,0));
  contour.push_back(Point(7,1));
  contour.push_back(Point(6,1));
  contour.push_back(Point(5,1));
  contour.push_back(Point(4,1));
  contour.push_back(Point(3,1));
  contour.push_back(Point(2,1));
  contour.push_back(Point(2,2));
  contour.push_back(Point(3,2));
  contour.push_back(Point(4,2));
  contour.push_back(Point(5,2));
  contour.push_back(Point(6,2));
  contour.push_back(Point(7,2));
  contour.push_back(Point(8,2));
  contour.push_back(Point(9,2));

  trace.beginBlock ( "Testing block ..." );

  typedef GridCurve< KhalimskySpaceND< 2, int > > Curve;
  typedef Curve::PointsRange::ConstIterator Iterator;
  typedef FrechetShortcut<Iterator,int> SegmentComputer;

  Curve aCurve; //grid curve
  aCurve.initFromVector(contour);

  typedef Curve::PointsRange Range; //range
  Range r = aCurve.getPointsRange(); //range

  Board2D board;
  board << r;
  board << aCurve.getArrowsRange();


  double anerror = 3;
  nbok =3;

  trace.beginBlock ( "Greedy segmentation" );
  {
    typedef GreedySegmentation<SegmentComputer> Segmentation;
    Segmentation theSegmentation( r.begin(), r.end(), SegmentComputer(anerror) );

    Segmentation::SegmentComputerIterator it = theSegmentation.begin();
    Segmentation::SegmentComputerIterator itEnd = theSegmentation.end();

    for ( ; it != itEnd; ++it) {
      SegmentComputer s(*it);
      trace.info() << s << std::endl;
      board << (*it);
      nb++;
    }

    //board << aCurve;
    trace.info() << theSegmentation << std::endl;
    board.saveEPS("FrechetShortcutGreedySegmentationTest.eps", Board2D::BoundingBox, 5000 );
  }

  /* Saturated segmentation does not work for FrechetShortcut
     computer. Indeed, given two maximal Frechet shortcuts s1(begin, end) et
     s2(begin, end),  we can have s1.begin < s2.begin < s2.end <
     s1.end. */


  trace.endBlock();

  return nbok == nb;
}





// Standard services - public :

int main( int argc, char** argv )
{
  trace.beginBlock ( "Testing class FrechetShortcut" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;

  testFrechetShortcutConceptChecking();

  bool res = testFrechetShortcut() && testSegmentation(); // && ... other tests
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}
//                                                                           //