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

walk used is the stochastic walk and not the line walk in locate

This commit is contained in:
Sébastien Loriot 2018-09-03 15:36:26 +02:00
parent f6aa83e09c
commit da0ca06329
1 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
Triangulation_2/doc/Triangulation_2/Triangulation_2.txt
View File

@ -379,12 +379,12 @@ Flip.
\subsection Triangulation_2Implementation Implementation \subsection Triangulation_2Implementation Implementation
Locate is implemented by a line walk. The walk Locate is implemented by a stochastic walk \cgalCite{cgal:dpt-wt-02}.
begins at a vertex of the face which The walk begins at a vertex of the face which
is given is given
as an optional argument or at an arbitrary vertex of the triangulation as an optional argument or at an arbitrary vertex of the triangulation
if no optional argument is given. It takes if no optional argument is given. It takes
time \f$ O(n)\f$ in the worst case, but only \f$ O(\sqrt{n})\f$ time \f$ O(n)\f$ in the worst case for Delaunay Triangulations, but only \f$ O(\sqrt{n})\f$
on average if the vertices are distributed uniformly at random. on average if the vertices are distributed uniformly at random.
The class `Triangulation_hierarchy_2<Traits,Tds>`, The class `Triangulation_hierarchy_2<Traits,Tds>`,
described in section \ref Section_2D_Triangulations_Hierarchy, described in section \ref Section_2D_Triangulations_Hierarchy,