CGAL 5.1 - 2D Polyline Simplification
PolylineSimplificationVertexBase_2 Class Reference

#include <Concepts/PolylineSimplificationVertexBase_2.h>

Definition

The polyline simplification algorithm stores in the vertices whether a vertex can be removed, and the cost of the removal.

Refines:
TriangulationVertexBase_2
Has Models:
CGAL::Polyline_simplification_2::Vertex_base_2<Vb>
See also
TriangulationFaceBase_2
CGAL::Constrained_triangulation_plus_2<Tr>

Public Types

typedef unspecified_type FT
 A number type which must be the same as the FT of the geometric traits class of the triangulation. More...
 

Access Functions

bool is_removable () const
 indicates whether the vertex can be removed. More...
 
void set_removable (bool b)
 allows to set whether the vertex can be removed. More...
 
FT cost () const
 returns the cost of the vertex removal. More...
 
void set_cost (const FT &ft)
 allows to set the cost of the vertex removal. More...
 

Member Typedef Documentation

◆ FT

typedef unspecified_type PolylineSimplificationVertexBase_2::FT

A number type which must be the same as the FT of the geometric traits class of the triangulation.

Member Function Documentation

◆ cost()

FT PolylineSimplificationVertexBase_2::cost ( ) const

returns the cost of the vertex removal.

◆ is_removable()

bool PolylineSimplificationVertexBase_2::is_removable ( ) const

indicates whether the vertex can be removed.

◆ set_cost()

void PolylineSimplificationVertexBase_2::set_cost ( const FT ft)

allows to set the cost of the vertex removal.

◆ set_removable()

void PolylineSimplificationVertexBase_2::set_removable ( bool  b)

allows to set whether the vertex can be removed.