Delaunay graphs are almost as good as complete graphs

Discrete & Computational Geometry - Tập 5 Số 4 - Trang 399-407 - 1990
David P. Dobkin1, Steven J. Friedman1, Kenneth J. Supowit1
1Department of Computer Science, Princeton University, 08544, Princeton, NJ, USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

P. Chew, 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.

T. Feder, personal communication, 1988.

F. P. Preparata and M. I. Shamos,Computational Geometry: An Introduction, Springer-Verlag, New York, 1985.

P. Raghavan, personal communication, 1987.