I/O-efficient point location using persistent B-trees
From MaRDI portal
Publication:5463442
DOI10.1145/996546.996549zbMath1085.68565OpenAlexW1978588217MaRDI QIDQ5463442
Andrew Danner, Lars Arge, Sha-Mayn Teh
Publication date: 4 August 2005
Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/jea/2003/ArgeIO/
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)
Related Items (11)
I/O-efficient dynamic planar point location ⋮ Optimal external memory planar point enclosure ⋮ Unnamed Item ⋮ Fully persistent B-trees ⋮ How to pack directed acyclic graphs into small blocks ⋮ Building an optimal point-location structure in \(O(\operatorname{sort}(n))\) I/Os ⋮ I/O-efficient path traversal in succinct planar graphs ⋮ The complexity of flow on fat terrains and its i/o-efficient computation ⋮ External memory planar point location with logarithmic updates ⋮ Dynamic Planar Point Location in External Memory. ⋮ Unnamed Item
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Making data structures persistent
- A space-optimal solution of general region location
- A new data structure for representing sorted lists
- The buffer tree: A technique for designing batched external data structures
- Efficient bulk operations on dynamic \(R\)-trees
- Organization and maintenance of large ordered indexes
- A new point-location algorithm and its practical efficiency: comparison with existing algorithms
- Optimal Search in Planar Subdivisions
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- I/O-efficient dynamic planar point location (extended abstract)
- External-memory algorithms for processing line segments in geographic information systems
This page was built for publication: I/O-efficient point location using persistent B-trees
