Progress on maximum weight triangulation

Authors:
Jianbo Qian;Cao An Wang
Affiliations:
School of Computer Science, University of Waterloo, Waterloo, Ontario, Canada N2L 3G1;Department of Computer Science, Memorial University of Newfoundland, St. John's, Newfoundland, Canada A1B 3X5
Venue:
Computational Geometry: Theory and Applications
Year:
2006

Citing 2
Cited 0

Quasi-greedy triangulations approximating the minimum weight triangulation

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Maximum weight triangulation and graph drawing

Information Processing Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we investigate various properties and problems associated with the maximum weight triangulation of a point set in the plane. We prove that the weight of a maximum weight triangulation of any planar point set with diameter D is bounded above by ((2@?+2)@?n+@p(1-2@?)8@?1-@?^2+@p2-5(@?+1))D, where @? is any constant 0