A space-efficient framework for dynamic point location
From MaRDI portal
Publication:4909571
DOI10.1007/978-3-642-35261-4_57zbMATH Open1260.68416OpenAlexW139724752MaRDI QIDQ4909571FDOQ4909571
Authors: Meng He, Patrick K. Nicholson, Norbert Zeh 
Publication date: 21 March 2013
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.716.5236
Recommendations
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (9)
- Competitive query strategies for minimising the ply of the potential locations of moving points
- Succinct geometric indexes supporting point location queries
- Dynamic planar point location with optimal query time
- Succinct and Implicit Data Structures for Computational Geometry
- Dynamic Distribution-Sensitive Point Location
- Facility Location in Dynamic Geometric Data Streams
- Succinct geometric indexes supporting point location queries
- I/O-Efficient Point Location in a Set of Rectangles
- Efficient Point Location in a Convex Spatial Cell-Complex
This page was built for publication: A space-efficient framework for dynamic point location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4909571)
