CGAL 4.7 - 2D Polyline Simplification: Concepts

\( \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.7 - 2D Polyline Simplification

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Classes
Concepts
2D Polyline Simplification Reference

##

## Concepts

concept | PolylineSimplificationCostFunction

Models of this concept are passed to the polyline simplification algorithm to calculate the cost of removing a vertex. Such a cost represents some measure of the deviation error between the polyline sets before and after removal. The smaller the error the lower the cost. The algorithm processes vertices in increasing cost order to preserve the overall polyline set shape as much as possible. More...

concept | PolylineSimplificationStopPredicate
| Models of this concept are passed to the polyline simplification algorithm to indicate when to stop the process. More...
concept | PolylineSimplificationVertexBase_2
| The polyline simplification algorithm stores in the vertices whether a vertex can be removed, and the cost of the removal. More...