| 
    CGAL 4.7 - 2D Polyline Simplification 
   | 
 
The polyline simplification algorithm stores in the vertices whether a vertex can be removed, and the cost of the removal.
Defines the same types as the TriangulationVertexBase_2 concept
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... | |
A number type which must be the same as the FT of the geometric traits class of the triangulation. 
| FT PolylineSimplificationVertexBase_2::cost | ( | ) | const | 
returns the cost of the vertex removal.
| bool PolylineSimplificationVertexBase_2::is_removable | ( | ) | const | 
indicates whether the vertex can be removed.
| void PolylineSimplificationVertexBase_2::set_cost | ( | const FT & | ft | ) | 
allows to set the cost of the vertex removal.
| void PolylineSimplificationVertexBase_2::set_removable | ( | bool | b | ) | 
allows to set whether the vertex can be removed.