Why (and how) it works Property 1 : the conflict zone is connected → compute conflict zone by dfs in dual graph Property 2 : conflict zone is starred with respect to p → re-triangulating the conflict zone w.r.t. p gives a triangulation Property 3 : every new Delaunay triangle is incident to p → re-triangulating the conflict zone w.r.t. p gives a Delaunay tr.
The Guibas/Stolfi variant • Locate point in triangulation
The Guibas/Stolfi variant • Locate point in triangulation • Star triangle
The Guibas/Stolfi variant • Locate point in triangulation • Star triangle • Apply flipping algo.
The Guibas/Stolfi variant • Locate point in triangulation • Star triangle • Apply flipping algo.
The Guibas/Stolfi variant • Locate point in triangulation • Star triangle • Apply flipping algo.
The Guibas/Stolfi variant • Locate point in triangulation • Star triangle • Apply flipping algo.
The Guibas/Stolfi variant • Locate point in triangulation • Star triangle → implemented in the Jcg library • Apply flipping algo.
Delaunay triangulation with constraints
Recommend
More recommend