Abstract
In this paper, we investigate the maximum weight triangulation of a point set in the plane. We prove that the weight of maximum weight triangulation of any planar point set with diameter D is bounded above by ((2ε+2)·n+π(1-2ε)/8ε√1-ε 2+π/2-5(ε+1))D, where ε for 0
Author supplied keywords
Cite
CITATION STYLE
APA
Chin, F. Y. L., Qian, J., & Wang, C. A. (2004). Progress on maximum weight triangulation. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3106, 53–61. https://doi.org/10.1007/978-3-540-27798-9_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free