\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.11.3 - 2D Polyline Simplification
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages

Functions

template<class Traits , class Container , class CostFunction , class StopFunction >
CGAL::Polygon_2< Traits,
Container > 
CGAL::Polyline_simplification_2::simplify (const CGAL::Polygon_2< Traits, Container > &polygon, CostFunction cost, StopFunction stop)
 Simplifies a single polygon. More...
 
template<class PointIterator , class CostFunction , class StopFunction , class PointOutputIterator >
PointOutputIterator CGAL::Polyline_simplification_2::simplify (PointIterator b, PointIterator e, CostFunction cost, StopFunction stop, PointOutputIterator out, bool close=false)
 Simplifies an open or closed polyline given as an iterator range of 2D CGAL points. More...
 
template<class CDT , class CostFunction , class StopFunction >
std::size_t CGAL::Polyline_simplification_2::simplify (CGAL::Constrained_triangulation_plus_2< CDT > &ct, typename CGAL::Constrained_triangulation_plus_2< CDT >::Constraint_id cid, CostFunction cost, StopFunction stop, bool remove_points=true)
 Simplifies a single polyline in a triangulation with polylines as constraints. More...
 
template<class CDT , class CostFunction , class StopFunction >
std::size_t CGAL::Polyline_simplification_2::simplify (CGAL::Constrained_triangulation_plus_2< CDT > &ct, CostFunction cost, StopFunction stop, bool remove_points=true)
 Simplifies all polylines in a triangulation with polylines as constraints. More...
 

Function Documentation

template<class Traits , class Container , class CostFunction , class StopFunction >
CGAL::Polygon_2<Traits,Container> CGAL::Polyline_simplification_2::simplify ( const CGAL::Polygon_2< Traits, Container > &  polygon,
CostFunction  cost,
StopFunction  stop 
)

Simplifies a single polygon.

Template Parameters
Traitsmust be a model of ConstrainedDelaunayTriangulationTraits_2
CostFunctionmust be a model of PolylineSimplificationCostFunction.
StopFunctionmust be a model of PolylineSimplificationStopPredicate
Attention
Any CGAL kernel can be used for Traits, but as the traits class is used for internally using a constrained Delaunay triangulation, it should be a kernel with at least exact predicates.

#include <CGAL/Polyline_simplification_2/simplify.h>

Examples:
Polyline_simplification_2/points_and_vertices.cpp, Polyline_simplification_2/simplify.cpp, and Polyline_simplification_2/simplify_polygon.cpp.
template<class PointIterator , class CostFunction , class StopFunction , class PointOutputIterator >
PointOutputIterator CGAL::Polyline_simplification_2::simplify ( PointIterator  b,
PointIterator  e,
CostFunction  cost,
StopFunction  stop,
PointOutputIterator  out,
bool  close = false 
)

Simplifies an open or closed polyline given as an iterator range of 2D CGAL points.

Template Parameters
PointIteratormust be an iterator with value type CGAL::Kernel::Point_2.
CostFunctionmust be a model of PolylineSimplificationCostFunction
StopFunctionmust be a model of PolylineSimplificationStopPredicate
PointOutputIteratormust be an output iterator to which CGAL::Kernel::Point_2 can be assigned.

#include <CGAL/Polyline_simplification_2/simplify.h>

template<class CDT , class CostFunction , class StopFunction >
std::size_t CGAL::Polyline_simplification_2::simplify ( CGAL::Constrained_triangulation_plus_2< CDT > &  ct,
typename CGAL::Constrained_triangulation_plus_2< CDT >::Constraint_id  cid,
CostFunction  cost,
StopFunction  stop,
bool  remove_points = true 
)

Simplifies a single polyline in a triangulation with polylines as constraints.

Parameters
ctThe underlying constrained Delaunay triangulation which embeds the polyline constraints
cidThe constraint identifier of the polyline constraint to simplify
costThe cost function
stopThe stop function
remove_pointsIf true the function ct.remove_points_without_corresponding_vertex() is called.
Returns
the number of removed vertices
Template Parameters
CDTmust be CGAL::Constrained_triangulation_plus_2 with a vertex type that is model of PolylineSimplificationVertexBase_2.
CostFunctionmust be a model of PolylineSimplificationCostFunction
StopFunctionmust be a model of PolylineSimplificationStopPredicate

#include <CGAL/Polyline_simplification_2/simplify.h>

template<class CDT , class CostFunction , class StopFunction >
std::size_t CGAL::Polyline_simplification_2::simplify ( CGAL::Constrained_triangulation_plus_2< CDT > &  ct,
CostFunction  cost,
StopFunction  stop,
bool  remove_points = true 
)

Simplifies all polylines in a triangulation with polylines as constraints.

Parameters
ctThe underlying constrained Delaunay triangulation which embeds the polyline constraints
costThe cost function
stopThe stop function
remove_pointsIf true the function ct.remove_points_without_corresponding_vertex() is called.
Returns
the number of removed vertices
Template Parameters
CDTmust be CGAL::Constrained_triangulation_plus_2 with a vertex type that is model of PolylineSimplificationVertexBase_2.
CostFunctionmust be a model of PolylineSimplificationCostFunction
StopFunctionmust be a model of PolylineSimplificationStopPredicate

#include <CGAL/Polyline_simplification_2/simplify.h>