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

fix typos

This commit is contained in:
Andreas Fabri 2014-08-22 12:48:19 +02:00
parent ff81c1acf9
commit 425b900c5a
2 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Polyline_simplification_2/doc/Polyline_simplification_2/Polyline_simplification_2.txt
View File

@ -59,8 +59,8 @@ Check if vertex `q` can be removed.
\section Section_PolylineSimplification_Cost_Functions Cost Functions
The specific way in which the removal cost is calculated is called the
*cost* function. The user can choose different strategies by choosing
The specific way in which the removal cost is calculated is called the *cost*
function. The user can choose different strategies by choosing
a cost function object.
This package provides the three cost functions formulated in
@ -154,7 +154,7 @@ the number of vertices.
In the second example we insert several polygons in a
`Constrained_triangulation_plus_2`. As a vertex
type we have to use `CGAL::Polyline_simplification_2::Vertex_base`
type we have to use `CGAL::Polyline_simplification_2::Vertex_base_2`
as vertices may be marked as non-removable. The simplification
algorithm marks the first and last vertex of polyline constraints
as well as intersections.

2
Triangulation_2/doc/Triangulation_2/CGAL/Constrained_triangulation_plus_2.h
View File

@ -142,7 +142,7 @@ Constrained_triangulation_plus_2& ct);
/*!
Introduces a constrained triangulation
from the constraints in the range `[first,last)`.
\tparam ConstraintIterator must be an InputIterator` with the value type `std::pair<Point,Point>` or `Segment`.
\tparam ConstraintIterator must be an `InputIterator` with the value type `std::pair<Point,Point>` or `Segment`.
*/
template<class ConstraintIterator>
Constrained_triangulation_plus_2(