Abstract
In this paper, a chain decomposition algorithm is proposed and studied. Using this algorithm, we prove a property on minimum weight triangulations of points in the Euclidean plane, which shows that a special kind of line segments must be ira the minimum weight triangulations and in the greedy triangulation of a given point set.
Author supplied keywords
Cite
CITATION STYLE
Bo-Ting, Y., Yin-Feng, X., & Zhao-Yong, Y. (1994). A chain decomposition algorithm for the proof of a property on minimum weight triangulations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 834 LNCS, pp. 423–427). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_207
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
