Walking in a triangulation
From MaRDI portal
Publication:5361565
DOI10.1145/378583.378643zbMath1374.68659OpenAlexW2111938340MaRDI QIDQ5361565
Monique Teillaud, Sylvain Pion, Olivier Devillers
Publication date: 29 September 2017
Published in: Proceedings of the seventeenth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00344519/file/Walking_in_a_triangulation_socg_2001.pdf
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
Expected time analysis for Delaunay point location ⋮ HCPO: an efficient insertion order for incremental Delaunay triangulation ⋮ Constructing Voronoi diagrams from hollow spheres using conformal geometric algebra ⋮ On the performance of self-organizing maps for the non-Euclidean traveling salesman problem in the polygonal domain ⋮ Structural filtering: a paradigm for efficient and exact geometric programs ⋮ Kinetic and dynamic Delaunay tetrahedralizations in three dimensions ⋮ A sub-linear time algorithm for approximating k-nearest-neighbor with full quality guarantee ⋮ Efficient implementation of characteristic-based schemes on unstructured triangular grids ⋮ Triangulations in CGAL
