songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

No need for PolylineSimplificationTraits_2

This commit is contained in:
Andreas Fabri 2014-12-22 12:28:08 +01:00
parent b85f97593a
commit c5aa594388
3 changed files with 1 additions and 31 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationCostFunction.h
View File

@ -32,7 +32,7 @@ Given a vertex in constraint iterator `viq` computes `vip=std::prev(viq)` and `v
\tparam CDT must be `CGAL::Constrained_Delaunay_triangulation_2` with a vertex type that
is model of `PolylineSimplificationVertexBase_2`. `CDT::Geom_traits` must be model of
the concept `PolylineSimplificationTraits_2`.
the concept `ConstrainedDelaunayTriangulationTraits_2`.
*/
template <typename CDT>

29
Polyline_simplification_2/doc/Polyline_simplification_2/Concepts/PolylineSimplificationTraits_2.h
View File

@ -1,29 +0,0 @@
/*!
\ingroup PkgPolylineSimplification2Concepts
\cgalConcept
The concept gives the required predicates and constructions
for the polyline simplification.
\cgalRefines `ConstrainedDelaunayTriangulationTraits_2`
\cgalHasModel All \cgal Kernels
*/
class PolylineSimplificationTraits_2 {
public:
/*!
A function object to compute a squared distance for two points.
Provides the operator:
`unspecified_type operator()(Point_2 p, Point_2 q)`
which returns the squared distance between `p` and `q`.
*/
typedef unspecified_type Compute_squared_distance_2;
};

1
Polyline_simplification_2/doc/Polyline_simplification_2/PackageDescription.txt
View File

@ -34,7 +34,6 @@
## Concepts ##
- `PolylineSimplificationTraits_2`
- `PolylineSimplificationCostFunction`
- `PolylineSimplificationStopPredicate`
- `PolylineSimplificationVertexBase_2`