Succinct geometric indexes supporting point location queries

DOI10.1145/2151171.2151173zbMath1295.68100OpenAlexW2114804538MaRDI QIDQ3189051

Anil Maheshwari, Meng He, Pat Morin, Prosenjit Bose, Eric Y. Chen

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2151171.2151173

zbMATH Keywords

succinct data structurespoint locationgeometric data structuresplanar triangulationsmembershipimplicit data structuresplanar subdivisionsvertical ray shootinggeometric queriessuccinct geometric indexes

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (max. 100)

I/O-efficient path traversal in succinct planar graphs ⋮ Optimal in-place and cache-oblivious algorithms for 3-D convex hulls and 2-D segment intersection ⋮ Succinct and Implicit Data Structures for Computational Geometry ⋮ Navigating planar topologies in near-optimal space and time ⋮ Succinct Color Searching in One Dimension

This page was built for publication: Succinct geometric indexes supporting point location queries