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 in the minimum weight triangulations and in the greedy triangulation of a given point set.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
L. S. Heath and S. V. Pemmaraju, New results for the minimum weight triangulation problem, TR 90-65, Virginia Polytechnic Institute and state University, 1990.
A. Lingas, A new heuristic for the minimum weight triangulation, SIAM Journal of Algebraic and Discrete Methods 8, 646–658. 1987.
Y. F. Xu, Minimum Weight trianuglation problem of a planar point set, ph. D. thesis, Institute of Applied Mathematics, Academia Sinica, Beiing, 1992.
F. Preparata and M. I. Shamos. Computational Geometry, Springer-Verlag, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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: Du, DZ., Zhang, XS. (eds) Algorithms and Computation. ISAAC 1994. Lecture Notes in Computer Science, vol 834. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58325-4_207
Download citation
DOI: https://doi.org/10.1007/3-540-58325-4_207
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58325-7
Online ISBN: 978-3-540-48653-4
eBook Packages: Springer Book Archive