Partitioned Neighborhood Spanners of Minimal Outdegree
|
Abstract:
A geometric spanner with vertex set P ae IR D is a sparse approximation of the complete Euclidean graph determined by P. We introduce the notion of partitioned neighborhood graphs (PNGs), unifying and generalizing most constructions of spanners treated in literature. Two important parameters characterizing their properties are the outdegree k 2 IN and the stretch factor f? 1 describing the `quality ' of the approximation. PNGs have been throughly investigated with respect to small values of f. We present in this work results about small values of k. The aim of minimizing k rather than f arises from two observations: a) k determines the amount of space required for storing PNGs. b) Many algorithms employing a (previously constructed) spanner have running times depending on its outdegree. Our results include, for fixed dimensions D as well as asymptotically, upper and lower bounds on this optimal value of k. The upper bounds are shown constructively and yield efficient algorithms for actually computing the corresponding PNGs even in degenerate cases. 1
Citations
| 65 | Approximation algorithms for shortest path motion planning – Clarkson - 1987 |
| 21 | Constructing degree-3 spanners with other sparseness properties – DAN, HEFFERNAN |
| 21 | Euclidean Geometry and Convexity – Benson - 1966 |
| 3 | Agarwal and Jeff Erickson: "Geometric Range Searching and Its Relatives ", to appear – Pankaj - 1998 |
| 3 | Giuseppe Liotta: "A robust region approach to the computation of geometric graphs – d'Amore, Franciosa |
| 3 | Michiel Smid: "Lower Bounds for Computing Geometric Spanners and Approximate Shortest Paths – Chen, Das - 1996 |
| 1 | Euclidean Geometriy and Convexity – Benson |
| 1 | Guibas: "Fractional cascading: I. A data structuring technique", Algorithmica 1 – Chazelle, Leonidas - 1986 |
