I/O-efficient algorithms for computing planar geometric spanners

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