WALKING IN A TRIANGULATION

DOI10.1142/S0129054102001047zbMath1066.68139OpenAlexW2134240078MaRDI QIDQ3021946

Monique Teillaud, Olivier Devillers, Sylvain Pion

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054102001047

zbMATH Keywords

computational geometryrandomized algorithmsDelaunay triangulationgeometric computing

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Randomized algorithms (68W20)

Related Items (11)

Practical distribution-sensitive point location in triangulations ⋮ Walking in a Planar Poisson–Delaunay Triangulation: Shortcuts in the Voronoi Path ⋮ An efficient and robust localization scheme on massively distributed systems ⋮ The stochastic walk algorithms for point location in pseudo-triangulations ⋮ Computing equilibria in dynamic models with occasionally binding constraints ⋮ Classroom examples of robustness problems in geometric computations ⋮ Efficiently navigating a random Delaunay triangulation ⋮ Parallel geometric algorithms for multi-core computers ⋮ Expected length of the Voronoi path in a high dimensional Poisson-Delaunay triangulation ⋮ Stretch factor in a planar Poisson–Delaunay triangulation with a large intensity ⋮ TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator

Cites Work

• An acyclicity theorem for cell complexes in d dimensions
• On sorting triangles in a Delaunay tessellation
• Optimal Search in Planar Subdivisions
• Computing Dirichlet Tessellations in the Plane

This page was built for publication: WALKING IN A TRIANGULATION