CGAL 4.7 - 2D Polyline Simplification: Polyline Simplification Classes

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

##

## Classes

class | CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost< FT >
| This class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines, possibly scaled based on a factor. More...
class | CGAL::Polyline_simplification_2::Scaled_squared_distance_cost
| This class is a cost function which calculates the cost as a scaled variant of the square of the distance between the original and simplified polylines. More...
class | CGAL::Polyline_simplification_2::Squared_distance_cost
| This class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines. More...
class | CGAL::Polyline_simplification_2::Stop_above_cost_threshold
| This class is a stop predicate returning `true` when the cost for simplifying a vertex is greater than a certain threshold. More...
class | CGAL::Polyline_simplification_2::Stop_below_count_ratio_threshold
| This class is a stop predicate returning `true` when the percentage of remaning vertices is smaller than a certain threshold. More...
class | CGAL::Polyline_simplification_2::Stop_below_count_threshold
| This class is a stop predicate returning `true` when the number of vertices is smaller than a certain threshold. More...
class | CGAL::Polyline_simplification_2::Vertex_base_2< K, Vb >
| A vertex base class with data members needed by the simplification algorithm. More...