Abstract
A setV ofn points ink-dimensional space induces a complete weighted undirected graph as follows. The points are the vertices of this graph and the weight of an edge between any two points is the distance between the points under someL p metric. Let ε≤1 be an error parameter and letk be fixed. We show how to extract inO(n logn+ε−k log(1/ε)n) time a sparse subgraphG=(V, E) of the complete graph onV such that: (a) for any two pointsx, y inV, the length of the shortest path inG betweenx andy is at most (1+∈) times the distance betweenx andy, and (b)|E|=O(ε−k n).
Article PDF
Similar content being viewed by others
References
P. Chew, There is a planar graph almost as good as the complete graph,Proc. 2nd Annual Symposium on Computational Geometry, 1986, pp 169–177.
K. L. Clarkson, Fast algorithms for the all-nearest-neighbors problem,Proc. 24th Annual Symposium on Foundations Computer Science, 1983, pp. 226–232.
K. L. Clarkson, Approximation algorithms for shortest path motion planning,Proc. 19th Annual ACM Symposium Theory of Computing, 1987, pp. 56–65.
D. P. Dobkin, S. J. Friedman, and K. J. Supowit, Delaunay graphs are almost as good as complete graphs,Discrete Comput. Geom. 5 (1990), 399–408.
T. Feder, Personal communication, 1989.
R. A. Finkel and J. L. Bentley, Quad-trees: a data structure for retrieval on composite keys,Acta Inform. 4 (1974), 1–9.
F. P. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.
E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms: Theory and Practice, Prentice Hall, Englewood Cliffs, NJ, 1977.
P. M. Vaidya, AnO(n logn) algorithm for the all-nearest-neighbors problem,Discrete Comput. Geom. 4 (1989), 399–408.
P. M. Vaidya, Approximate minimum weight matching on points ink-dimensional space,Algorithmica,4 (1989), 569–584.
A. C. Yao, On construction minimum spanning trees ink-dimensional space and related problems,SIAM J. Comput. 11 (1982), 721–736.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vaidya, P.M. A sparse graph almost as good as the complete graph on points inK dimensions. Discrete Comput Geom 6, 369–381 (1991). https://doi.org/10.1007/BF02574695
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02574695