There are planar graphs almost as good as the complete graph

Journal of Computer and System Sciences

Volumn 39, Issue 2, 1989, Pages 205-219

  Paul Chew, L ^a  

^a DARTMOUTH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0242375715     PISSN: 00220000     EISSN: 10902724     Source Type: Journal    
DOI: 10.1016/0022-0000(89)90044-5     Document Type: Article

References (12)

1. Visibility-polygon search and Euclidean shortest paths
2. Voronoi diagrams based on convex distance functions
3. There is a planar graph almost as good as the complete graph
4. Constrained Delaunay triangulations
5. Delaunay graphs are almost as good as complete graphs
6. A sweepline algorithm for Voronoi diagrams
7. Proximity and Reachibility in the Plane
8. Two algorithms for constructing Delaunay triangulations
9. 2) time