From da0ca06329fde1ff7495768d0dea80c7a1be6b46 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Mon, 3 Sep 2018 15:36:26 +0200 Subject: [PATCH] walk used is the stochastic walk and not the line walk in locate --- Triangulation_2/doc/Triangulation_2/Triangulation_2.txt | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt index 65688e950b0..e9bcdeccf88 100644 --- a/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt +++ b/Triangulation_2/doc/Triangulation_2/Triangulation_2.txt @@ -379,12 +379,12 @@ Flip. \subsection Triangulation_2Implementation Implementation -Locate is implemented by a line walk. The walk -begins at a vertex of the face which +Locate is implemented by a stochastic walk \cgalCite{cgal:dpt-wt-02}. +The walk begins at a vertex of the face which is given as an optional argument or at an arbitrary vertex of the triangulation 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. The class `Triangulation_hierarchy_2`, described in section \ref Section_2D_Triangulations_Hierarchy,