I/O-efficient algorithms for computing planar geometric spanners
From MaRDI portal
Publication:929749
DOI10.1016/j.comgeo.2007.07.007zbMath1143.65017OpenAlexW2016064056MaRDI QIDQ929749
Michiel H. M. Smid, Norbert Zeh, Anil Maheshwari
Publication date: 18 June 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.07.007
Extremal problems in graph theory (05C35) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)
Related Items (2)
Euclidean Steiner Spanners: Light and Sparse ⋮ On plane geometric spanners: a survey and open problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new data structure for representing sorted lists
- Classes of graphs which approximate the complete Euclidean graph
- Algorithms for memory hierarchies. Advanced lectures
- The buffer tree: A technique for designing batched external data structures
- A sparse graph almost as good as the complete graph on points in \(k\) dimensions
- An external memory data structure for shortest path queries
- I/O-efficient well-separated pair decomposition and applications
- Organization and maintenance of large ordered indexes
- On external-memory MST, SSSP and multi-way planar graph separation
- Geometric Spanner Networks
- On Constructing Minimum Spanning Trees in k-Dimensional Spaces and Related Problems
- CONSTRUCTING MULTIDIMENSIONAL SPANNER GRAPHS
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Planar spanners and approximate shortest path queries among obstacles in the plane
- RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
- Algorithms and Computation
- External-memory algorithms for processing line segments in geographic information systems
This page was built for publication: I/O-efficient algorithms for computing planar geometric spanners
