testContourHelper.cpp File Reference

#include <iostream>
#include "DGtal/base/Common.h"
#include "ConfigTest.h"
#include "DGtal/geometry/helpers/ContourHelper.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/kernel/PointVector.h"

Include dependency graph for testContourHelper.cpp:

Go to the source code of this file.

Functions
bool	testContourHelper ()
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

Bertrand Kerautret (kerau.nosp@m.tre@.nosp@m.loria.nosp@m..fr ) LORIA (CNRS, UMR 7503), University of Nancy, France

Date

2014/06/11

Functions for testing class ContourHelper.

This file is part of the DGtal library.

Definition in file testContourHelper.cpp.

Function Documentation

main()

int main	(	int	argc,
		char **	argv )

Definition at line 116 of file testContourHelper.cpp.

{
  trace.beginBlock ( "Testing class ContourHelper" );
  trace.info() << "Args:";
  for ( int i = 0; i < argc; ++i )
    trace.info() << " " << argv[ i ];
  trace.info() << endl;
 
  bool res = testContourHelper(); // && ... other tests
  trace.emphase() << ( res ? "Passed." : "Error." ) << endl;
  trace.endBlock();
  return res ? 0 : 1;
}

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

testContourHelper()

bool testContourHelper

(

)

Example of a test. To be completed.

Definition at line 49 of file testContourHelper.cpp.

{
  unsigned int nbok = 0;
  unsigned int nb = 0;
  
  trace.beginBlock ( "Test ContourHelper:  getgetBarycenter and isCounterClockWise" );
  std::vector<Z2i::Point> aContour; 
  aContour.push_back(Z2i::Point(0,0));
  aContour.push_back(Z2i::Point(10,0));
  aContour.push_back(Z2i::Point(10,4));
  aContour.push_back(Z2i::Point(0,4));
  Z2i::RealPoint midPoint = ContourHelper::getBarycenter(aContour);   
 
  std::vector<Z2i::Point> aContour2; 
  aContour2.push_back(Z2i::Point(0,0));
  aContour2.push_back(Z2i::Point(0,10));
  aContour2.push_back(Z2i::Point(5,10));
 
  nbok += midPoint==Z2i::Point(5,2) ? 1 : 0; 
  nb++;
  nbok += ContourHelper::isCounterClockWise(aContour) ? 1 : 0; 
  nb++;
  nbok += ContourHelper::isCounterClockWise(aContour2) ? 0 : 1; 
  nb++;
  trace.endBlock();
 
  trace.beginBlock("Test ContourHelper:  pixels2pixels8c ");
 
  std::vector<Z2i::Point> aContour3;
  aContour3.push_back(Z2i::Point(0,0));
  aContour3.push_back(Z2i::Point(1,0));
  aContour3.push_back(Z2i::Point(1,1));
  aContour3.push_back(Z2i::Point(2,1));
  aContour3.push_back(Z2i::Point(3,1));
  aContour3.push_back(Z2i::Point(4,1));
  aContour3.push_back(Z2i::Point(4,2));
  aContour3.push_back(Z2i::Point(5,2));
  aContour3.push_back(Z2i::Point(6,2));
  std::vector<Z2i::Point> res, res2;
    
  ContourHelper::pixels2pixels8C(aContour3.begin(),
                                 aContour3.end(), std::back_inserter(res));
  trace.info() << "Apply pixels2pixels8c (from std::vector contour)init size : " << res.size() << " (should be: " << aContour3.size() -2  << " ) "<< std::endl;  
  trace.info() << "Third point : " << res[2] << " (should be: " << Z2i::Point(2,1) << " ) "<< std::endl;  
  nb++;
  nbok += res.size() ==  aContour3.size() -2 || Z2i::Point(2,1)==res[2];
 
  typedef GridCurve< KhalimskySpaceND<2>> GridCurve2d ;
  GridCurve2d gc;
  gc.initFromPointsVector(aContour3);
  ContourHelper::pixels2pixels8C(gc.getPointsRange().begin(),
                                 gc.getPointsRange().end(), std::back_inserter(res2));
  trace.info() << "Apply pixels2pixels8c (from GridCurve contour) init size : " << res2.size() << " (should be: " << aContour3.size() -2  << " ) "<< std::endl;  
  trace.info() << "Third point : " << res2[2] << " (should be: " << Z2i::Point(2,1) << " ) "<< std::endl;  
  nb++;
  nbok += res2.size() ==  aContour3.size() -2 || Z2i::Point(2,1)==res2[2];
  
  trace.info() << "(" << nbok << "/" << nb << ") "<< std::endl;
  
  for(auto p: res)
    trace.info() << p << std::endl;
  return nbok == nb;
}

References DGtal::Trace::beginBlock(), DGtal::Trace::endBlock(), DGtal::ContourHelper::getBarycenter(), DGtal::Trace::info(), DGtal::GridCurve< TKSpace >::initFromPointsVector(), DGtal::ContourHelper::isCounterClockWise(), DGtal::ContourHelper::pixels2pixels8C(), DGtal::PointVector< dim, TEuclideanRing, TContainer >::size(), and DGtal::trace.

Referenced by main().