| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 415849 | Computational Geometry | 2008 | 20 Pages |
Abstract
We present I/O-efficient algorithms for computing planar Steiner spanners for point sets and sets of polygonal obstacles in the plane.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
