We present I/O-efficient algorithms for computing planar Steiner spanners for point sets and sets of polygonal obstacles in the plane.

Additional Metadata
Keywords Computational geometry, External-memory algorithms, Geometric spanners, Shortest paths
Persistent URL dx.doi.org/10.1016/j.comgeo.2007.07.007
Journal Computational Geometry
Citation
Maheshwari, A, Smid, M, & Zeh, N. (Norbert). (2008). I/O-efficient algorithms for computing planar geometric spanners. Computational Geometry, 40(3), 252–271. doi:10.1016/j.comgeo.2007.07.007