Classes of graphs which approximate the complete euclidean graph
- 380 Downloads
LetS be a set ofN points in the Euclidean plane, and letd(p, q) be the Euclidean distance between pointsp andq inS. LetG(S) be a Euclidean graph based onS and letG(p, q) be the length of the shortest path inG(S) betweenp andq. We say a Euclidean graphG(S)t-approximates the complete Euclidean graph if, for everyp, q εS, G(p, q)/d(p, q) ≤t. In this paper we present two classes of graphs which closely approximate the complete Euclidean graph. We first consider the graph of the Delaunay triangulation ofS, DT(S). We show that DT(S) (2π/(3 cos(π/6)) ≈ 2.42)-approximates the complete Euclidean graph. Secondly, we defineθ(S), the fixed-angleθ-graph (a type of geometric neighbor graph) and show thatθ(S) ((1/cosθ)(1/(1−tanθ)))-approximates the complete Euclidean graph.
KeywordsShort Path Voronoi Diagram Discrete Comput Geom Delaunay Triangulation Inductive Assumption
- 2.Chew, P., There is a planar graph almost as good as the complete graph,Proceedings of the Second Symposium on Computational Geometry, Yorktown Heights, NY, 1986, pp. 169–177.Google Scholar
- 4.Dobkin, D., S. Friedman, and K. Supowit, Delaunay graphs are almost as good as complete graphs,Proceedings of the 28th Annual Symposium on Foundations of Computing, Los Angeles, CA, 1987, pp. 20–26.Google Scholar
- 8.Wee, Y. C., Chaiken, S., and Willard D. E., General metrics and angle restricted Voronoi diagrams, Presented at the First Canadian Conference on Computational Geometry, Montreal, August 1989.Google Scholar