There is a planar graph almost as good as the complete graph

Proceedings of the 2nd Annual Symposium on Computational Geometry, SCG 1986

Volumn , Issue , 1986, Pages 169-177

  Chew, L Paul ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPHIC METHODS; MOTION PLANNING; TRIANGULATION;

COMPLETE GRAPHS; DELAU-NAY TRIANGULATIONS; EUCLIDEAN DISTANCE; PLANAR GRAPH; SHORTEST PATH; TWO-POINT;

GRAPH THEORY;

EID: 85025279982     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/10515.10534     Document Type: Conference Paper

References (9)

1. T. Asano, T. Asano, L. Guibas, J. Hershberger, H. Imal, Visibility-polygon search and Euclidean shortest paths, Proc. 26th IEEE Symposium on Foundations of Computer Scienee (1985), 155-164.
2. L. P. Chew and R. L. Drysdale, Voronoi diagrams based on convex distance functions, Proc. 1st Symposium on Computational Geometry, Baltimore' (1985), 235-244.
3. F. K. Hwang, An O(n log n) algorithm for rectilinear minimal spanning trees, JACM 26(1979), 177-182.
4. D. T. Lee and B. Schachter, Two algorithms for constructing Delaunay triangulations, International Journal of Computer and Information Sciences, 9:3 (1980), 219-242.
5. C. H. Papadimitriou, An algorithm for shortest-path motion in three dimensions, Information Processing Letters, 20 (1985), 259-263.
6. M. I. Shamos and D. Hoey, Closest-point problems, Proc. 16th IEEE Symposium on Foundations of Computer Science (1975), 151-162.
7. M. Sharif, On shortest paths amidst convex polyhedra, Tech. Rept. 181, Computer Science Division, Courant Institute of Mathematical Sciences (1985).
8. M. Sharir and A. Schorr, On shortest paths in polyhedral spaces, Proc. 16th ACM Symposium on Theory of Computing (1984), 144-153.
9. E. Welzl, Constructing the visibility graph for n line segments in O(n) time, Information Processing Letters, 20 (1985), 167-171.