|
CGAL 6.0 - 2D Polyline Simplification
|
#include <CGAL/Polyline_simplification_2/Hybrid_squared_distance_cost.h>
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.
PolylineSimplificationCostFunction Public Member Functions | |
| Hybrid_squared_distance_cost (FT ratio) | |
Initializes the cost function with the specified ratio | |
| template<class CDT > | |
| std::optional< typename CDT::Geom_traits::FT > | operator() (const Constrained_triangulation_plus_2< CDT > &pct, typename Constrained_triangulation_plus_2< CDT >::Vertices_in_constraint_iterator vicq) const |
| Compute the hybrid squared distance cost. | |
| std::optional< typename CDT::Geom_traits::FT > CGAL::Polyline_simplification_2::Hybrid_squared_distance_cost< FT >::operator() | ( | const Constrained_triangulation_plus_2< CDT > & | pct, |
| typename Constrained_triangulation_plus_2< CDT >::Vertices_in_constraint_iterator | vicq | ||
| ) | const |
Compute the hybrid squared distance cost.
Given a vertex in constraint iterator vicq computes vicp=std::prev(vicq) and vicr=std::next(vicq), returns the maximal square distance between each point along the original subpolyline, between vicp and vicr, and the straight line segment from *vicp->point() to *vicr->point() divided by the smallest of
vicq.| CDT | must be CGAL::Constrained_Delaunay_triangulation_2 with a vertex type that is model of PolylineSimplificationVertexBase_2. |