CGAL 5.6.1 - 2D Polyline Simplification
CGAL::Polyline_simplification_2 Namespace Reference

Classes

class  Hybrid_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, possibly scaled based on a factor. More...
 
class  Polyline_simplification_2
 
class  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  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  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  Stop_below_count_ratio_threshold
 This class is a stop predicate returning true when the percentage of remaining vertices is smaller than a certain threshold. More...
 
class  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  Vertex_base_2
 A vertex base class with data members needed by the simplification algorithm. More...
 

Functions

template<class Traits , class Container , class CostFunction , class StopFunction >
CGAL::Polygon_2< Traits, Containersimplify (const CGAL::Polygon_2< Traits, Container > &polygon, CostFunction cost, StopFunction stop)
 Simplifies a single polygon. More...
 
template<class Traits , class Container , class CostFunction , class StopFunction >
CGAL::Polygon_with_holes_2< Traits, Containersimplify (const CGAL::Polygon_with_holes_2< Traits, Container > &polygon, CostFunction cost, StopFunction stop)
 Simplifies a single polygon with holes. More...
 
template<class PointIterator , class CostFunction , class StopFunction , class PointOutputIterator >
PointOutputIterator 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 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 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...