Which triangulations approximate the complete graph?: Conference abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 401 LNCS, Issue , 1989, Pages 168-192

  Das, Gautam ^a   Joseph, Deborah ^a  

^a UNIVERSITY OF WISCONSIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; GRAPHIC METHODS; SURVEYING; TRIANGULATION;

COMPLETE GRAPHS; CONSTRUCTING ALGORITHMS; DELAU-NAY TRIANGULATIONS; GRAPH ALGORITHMS; MINIMUM WEIGHT TRIANGULATION; SPARSE APPROXIMATIONS; SPARSE NETWORK; TRIANGULATION ALGORITHMS;

GRAPH THEORY;

EID: 85032225490     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-51859-2_15     Document Type: Conference Paper

References (6)

1. Chew: There is a Planar Graph Almost as Good as the Complete Graph: ACM Symposium on Computational Geometry, 1986, 169–177.
2. Das, Joseph: Planar Euclidean Graphs and their uses in Network Design: Technical Report, UW-Madison, in preparation.
3. Dobkin, Friedman, Deepa Supowit: Delaunay Graphs are Almost as Good as Complete Graphs: IEEE Symposium on Foundations of Computer Science, 1987, 20–26.
4. Klincsek: Minimal Triangulations of Polygonal Domains: Annals of Discrete Mathematics 9, 1980, 121–123.
5. Lingas: On Approximation Behavior and Implementation of the Greedy Triangulation for Convex Planar Point Sets: ACM Symposium on Computational Geometry, 1986, 72–79.
6. Manacher, Zobrist: Neither the Greedy nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation: Information Processing Letters, July 1979, 31–34.