Data Structures | Namespaces | Defines | Functions

GreedyDecomposition.h File Reference

#include <iostream>
#include "DGtal/base/Common.h"
#include "DGtal/geometry/2d/GreedyDecomposition.ih"
Include dependency graph for GreedyDecomposition.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

class  DGtal::GreedyDecomposition< Contour, Primitive >
 Aim: Computes the greedy decomposition of a contour into primitives (the last point of the primitive i is the first point of the primitive i+1). More...
class  DGtal::GreedyDecomposition< Contour, Primitive >::ConstIterator


namespace  DGtal


#define GreedyDecomposition_RECURSES
#define GreedyDecomposition_h


template<typename Contour , typename Primitive >
std::ostream & DGtal::operator<< (std::ostream &out, const GreedyDecomposition< Contour, Primitive > &object)

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 <>.

Tristan Roussillon ( ) Laboratoire d'InfoRmatique en Image et Systèmes d'information - LIRIS (CNRS, UMR 5205), CNRS, France

Header file for module GreedyDecomposition.cpp

This file is part of the DGtal library.

Define Documentation

#define GreedyDecomposition_h

Prevents repeated inclusion of headers.

#define GreedyDecomposition_RECURSES

Prevents recursive inclusion of headers.