testImplicitDigitalSurface-benchmark.cpp

 
#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/topology/DigitalSurface.h"
#include "DGtal/topology/DigitalSetBoundary.h"
#include "DGtal/topology/ImplicitDigitalSurface.h"
#include "DGtal/graph/BreadthFirstVisitor.h"
#include "DGtal/shapes/Shapes.h"
 
using namespace std;
using namespace DGtal;
 
// Functions for testing class ImplicitDigitalSurface.
namespace DGtal {
  template <typename KSpace, typename PointPredicate>
  bool
  testImplicitDigitalSurface( const KSpace & K, 
                              const PointPredicate & pp,
                              const typename KSpace::Surfel & bel )
  {
    typedef ImplicitDigitalSurface<KSpace,PointPredicate> Boundary;
    typedef typename Boundary::SurfelConstIterator ConstIterator;
    
    unsigned int nbok = 0;
    unsigned int nb = 0;
    trace.beginBlock ( "Testing block ... ImplicitDigitalSurface" );
    trace.beginBlock ( "ImplicitDigitalSurface instanciation" );
    Boundary boundary( K, pp,
                       SurfelAdjacency<KSpace::dimension>( true ), bel,
                       true );
    trace.endBlock();
    trace.beginBlock ( "Counting the number of surfels (breadth first traversal)" );
    unsigned int nbsurfels = 0;
    for ( ConstIterator it = boundary.begin(), it_end = boundary.end();
          it != it_end; ++it )
      {
        ++nbsurfels;
      }
    trace.info() << nbsurfels << " surfels found." << std::endl;
    nb++; nbok += nbsurfels == 354382 ? 1 : 0;
    trace.info() << "(" << nbok << "/" << nb << ") "
                   << "nbsurfels == 354382" << std::endl;
    trace.endBlock();
    trace.endBlock();
    return nbok == nb;
  }
  
 
  template <typename TPoint3>
  struct ImplicitDigitalEllipse3 {
    typedef TPoint3 Point;
    inline
    ImplicitDigitalEllipse3( double a, double b, double c )
      : myA( a ), myB( b ), myC( c )
    {}
    inline
    bool operator()( const TPoint3 & p ) const
    {
      double x = ( (double) p[ 0 ] / myA );
      double y = ( (double) p[ 1 ] / myB );
      double z = ( (double) p[ 2 ] / myC );
    return ( x*x + y*y + z*z ) <= 1.0;
    }
    double myA, myB, myC;
  };
}
 
// Standard services - public :
 
int main( int , char** )
{
  using namespace Z3i;
  typedef DGtal::ImplicitDigitalEllipse3<Point> ImplicitDigitalEllipse;
  typedef KSpace::SCell Surfel;
  bool res;
  trace.beginBlock ( "Testing class Object" );
  Point p1( -200, -200, -200 );
  Point p2( 200, 200, 200 );
  KSpace K;
  if ( K.init( p1, p2, true ) )
    {
      ImplicitDigitalEllipse ellipse( 180.0, 135.0, 102.0 );
      Surfel bel = Surfaces<KSpace>::findABel( K, ellipse, 10000 );
      res = 
        testImplicitDigitalSurface<KSpace, ImplicitDigitalEllipse>
        ( K, ellipse, bel );
    }
  else
    res = false;
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}