CGAL 6.2 - 2D Polyline Simplification

Loading...
Searching...
No Matches
List of all members | Public Member Functions
CGAL::Polyline_simplification_2::Squared_distance_cost Class Reference
Reference Manual » Polyline Simplification Classes

`#include <CGAL/Polyline_simplification_2/Squared_distance_cost.h>`

## Definition

This class is a cost function which calculates the cost as the square of the distance between the original and simplified polylines.

Is model of
  `PolylineSimplificationCostFunction`

## Public Member Functions
| Squared_distance_cost ()
| Initializes the cost function.
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
| Given a vertex in constraint iterator `vicq` computes `vicp=std::prev(vicq)` and `vicr=std::next(vicq)`,.

## Member Function Documentation

## ◆ operator()()

template<class CDT >

std::optional< typename CDT::Geom_traits::FT > CGAL::Polyline_simplification_2::Squared_distance_cost::operator() | ( | const Constrained_triangulation_plus_2< CDT > & | pct,
|  | typename Constrained_triangulation_plus_2< CDT >::Vertices_in_constraint_iterator | vicq
| ) |  | const

Given a vertex in constraint iterator `vicq` computes `vicp=std::prev(vicq)` and `vicr=std::next(vicq)`,.

returns the maximum of the square distances between each point along the original subpolyline, between `vicp` and `vicr`, and the straight line segment from `*vicp->point() to *vicr->point()`.

Template Parameters

  CDT | must be `CGAL::Constrained_Delaunay_triangulation_2` with a vertex type that is model of `PolylineSimplificationVertexBase_2`.