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

polish doc

This commit is contained in:
Andreas Fabri 2019-04-11 12:05:38 +02:00
parent a9bb23ce64
commit e5217dc67c
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
Partition_2/doc/Partition_2/Partition_2.txt
View File

@ -95,9 +95,9 @@ as the algorithm of Hertel and Mehlhorn implemented with
`approx_convex_partition_2()` but can sometimes produce better
results (i.e., convex partitions with fewer pieces).
\section secpartition_2_examples Example
\section secpartition_2_examples Examples
Examples of the uses of all of these functions are provided with the
Examples of the uses of all of the above partition functions are provided with the
corresponding reference pages.
In the following we illustrate how to use an adapter trais class that enables to
@ -112,8 +112,8 @@ the concept `PartitionTraits_2` on these points.
\cgalExample{Partition_2/y_monotone_partition_indices_2.cpp}
The traits adapter enables to partition faces of a polygonal mesh, or to access
points which are a component of a `std::tuple`.
In a similar way, the traits adapter enables to partition faces of a polygonal mesh,
or to access points which are a component of a `std::tuple`.
\section secpartition_2_history Implementation History