\( \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.8.2 - 2D Polyline Simplification
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 1234]
oNCGAL
|\NPolyline_simplification_2
| oCStop_below_count_thresholdThis class is a stop predicate returning true when the number of vertices is smaller than a certain threshold
| oCSquared_distance_costThis class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines
| oCStop_above_cost_thresholdThis class is a stop predicate returning true when the cost for simplifying a vertex is greater than a certain threshold
| oCStop_below_count_ratio_thresholdThis class is a stop predicate returning true when the percentage of remaning vertices is smaller than a certain threshold
| oCHybrid_squared_distance_costThis 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
| oCVertex_base_2A vertex base class with data members needed by the simplification algorithm
| oCPolyline_simplification_2
| |oCCompare_cost
| |\CId_map
| \CScaled_squared_distance_costThis 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
oCPolylineSimplificationCostFunctionModels 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
oCPolylineSimplificationStopPredicateModels of this concept are passed to the polyline simplification algorithm to indicate when to stop the process
\CPolylineSimplificationVertexBase_2The polyline simplification algorithm stores in the vertices whether a vertex can be removed, and the cost of the removal