CGAL 6.0.1 - 2D Polyline Simplification
Loading...
Searching...
No Matches
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]
 NCGAL
 NPolyline_simplification_2
 CHybrid_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
 CPolyline_simplification_2
 CCompare_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
 CSquared_distance_costThis class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines
 CStop_above_cost_thresholdThis class is a stop predicate returning true when the cost for simplifying a vertex is greater than a certain threshold
 CStop_below_count_ratio_thresholdThis class is a stop predicate returning true when the percentage of remaining vertices is smaller than a certain threshold
 CStop_below_count_thresholdThis class is a stop predicate returning true when the number of vertices is smaller than a certain threshold
 CVertex_base_2A vertex base class with data members needed by the simplification algorithm
 CPolylineSimplificationCostFunctionModels 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
 CPolylineSimplificationStopPredicateModels 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