Data structures for halfplane proximity queries and incremental Voronoi diagrams
From MaRDI portal
(Redirected from Data structures for halfplane proximity queries and incremental Voronoi diagrams)
Publication:1755746
Publication:1755746
DOI10.1007/s00453-017-0389-yzbMath1410.68361arXivcs/0512091MaRDI QIDQ1755746
Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Boris Aronov, Joachim Gudmundsson, John Iacono, Michiel H. M. Smid
Publication date: 11 January 2019
Published in: Algorithmica, LATIN 2006: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/0512091
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68P05: Data structures
Related Items
Compressing Spatio-temporal Trajectories, Compressing spatio-temporal trajectories, On the minimum total length of interval systems expressing all intervals, and range-restricted queries, Conic nearest neighbor queries and approximate Voronoi diagrams