The Delauney Triangulation Closely Approximates the Complete Euclidean Graph

J. Mark Keil, Carl A. Gutwin. The Delauney Triangulation Closely Approximates the Complete Euclidean Graph. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, Workshop WADS 89, Ottawa, Canada, August 17-19, 1989, Proceedings. Volume 382 of Lecture Notes in Computer Science, pages 47-56, Springer, 1989.

Abstract

Abstract is missing.