mirror of https://github.com/CGAL/cgal
merge_simplify -> grid_simplify
This commit is contained in:
parent
34c8575249
commit
99d002b18a
|
|
@ -12,7 +12,7 @@ The following example reads an input point set and randomly deletes 75\% of the
|
|||
Function \ccc{CGAL::grid_simplify_point_set()} considers a regular grid covering the bounding box of the input point set, and clusters all points sharing the same cell of the grid by picking as representant one of the point arbitrarily chosen. This algorithm is slower than \ccc{CGAL::random_simplify_point_set()}. \\
|
||||
% PA: can't you do better? ie pick the point which minimizes sum of squared distances to others?
|
||||
% add example?
|
||||
\ccRefIdfierPage{CGAL::merge_simplify_point_set} \\
|
||||
\ccRefIdfierPage{CGAL::grid_simplify_point_set} \\
|
||||
|
||||
% Insert image merge_simplification.jpg/eps
|
||||
\begin{center}
|
||||
|
|
|
|||
Loading…
Reference in New Issue