exampleLMST2D.cpp File Reference

#include <iostream>
#include <iterator>
#include <vector>
#include "DGtal/base/Common.h"
#include "DGtal/base/BasicTypes.h"
#include "DGtal/helpers/StdDefs.h"
#include "DGtal/geometry/curves/ArithmeticalDSSComputer.h"
#include "DGtal/geometry/curves/SaturatedSegmentation.h"
#include "DGtal/geometry/curves/estimation/LambdaMST2D.h"

Include dependency graph for exampleLMST2D.cpp:

Go to the source code of this file.

Functions
int	main ()

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

Kacper Pluta (kacpe.nosp@m.r.pl.nosp@m.uta@e.nosp@m.siee.nosp@m..fr ) Laboratoire d'Informatique Gaspard-Monge - LIGM, France

Date

2015/09/27

An example file named LambdaMST2D.

This file is part of the DGtal library.

Definition in file exampleLMST2D.cpp.

Function Documentation

main()

int main

(

void

)

[LambdaMST2DStandardCtor]

[LambdaMST2DStandardCtor]

[LambdaMST2DTangential]

[LambdaMST2DTangential]

[LambdaMST2DPoint]

[LambdaMST2DPoint]

[LambdaMST2DFast]

[LambdaMST2DFast]

Definition at line 62 of file exampleLMST2D.cpp.

{
  typedef vector < Point > Container;
  typedef Container::const_iterator ConstIterator;
  typedef ArithmeticalDSSComputer < ConstIterator, int, 8 > SegmentComputer;
  typedef SaturatedSegmentation<SegmentComputer> Segmentation;
  LambdaMST2D < Segmentation > lmst;
  
  // Input points
  Container contour;
  contour.push_back(Point(18,18));
  contour.push_back(Point(17,19));
  contour.push_back(Point(16,20));
  contour.push_back(Point(15,21));
  contour.push_back(Point(14,22));
  contour.push_back(Point(13,23));
  contour.push_back(Point(12,24));
  contour.push_back(Point(11,25));
  contour.push_back(Point(10,26));
  contour.push_back(Point(9,27));
  contour.push_back(Point(8,28));
  
  // Initialization of tangential cover
  Segmentation segmenter ( contour.begin(), contour.end(), SegmentComputer() );
  lmst.attach ( segmenter );
  
  for ( ConstIterator it = contour.begin(); it != contour.end(); ++it )
    lmst.eval ( *it );
  
  lmst.init ( contour.begin(), contour.end() );
  std::vector < RealVector > tangent;
  lmst.eval < back_insert_iterator< vector < RealVector > > > ( contour.begin(), contour.end(),  back_inserter ( tangent ) );
  
  return 0;
}

References DGtal::LambdaMST2DEstimator< TSpace, TSegmentation, Functor >::attach(), DGtal::LambdaMST2DEstimator< TSpace, TSegmentation, Functor >::eval(), and DGtal::LambdaMST2DEstimator< TSpace, TSegmentation, Functor >::init().