Entropy, triangulation, and point location in planar subdivisions
From MaRDI portal
Publication:3189070
DOI10.1145/2229163.2229173zbMath1295.68197arXiv0901.1908OpenAlexW3101679532MaRDI QIDQ3189070
Vida Dujmović, Stefan Langerman, Pat Morin, John Iacono, Sébastien Collette
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0901.1908
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05)
Related Items
Distance-sensitive planar point location ⋮ Adaptive Point Location in Planar Convex Subdivisions ⋮ Biased range trees ⋮ Adaptive Planar Point Location
This page was built for publication: Entropy, triangulation, and point location in planar subdivisions