A chain decomposition algorithm for the proof of a property on minimum weight triangulations
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.
KeywordsChain algorithm triangulation computational geometry
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- A. Lingas, A new heuristic for the minimum weight triangulation, SIAM Journal of Algebraic and Discrete Methods 8, 646–658. 1987.Google Scholar
- Y. F. Xu, Minimum Weight trianuglation problem of a planar point set, ph. D. thesis, Institute of Applied Mathematics, Academia Sinica, Beiing, 1992.Google Scholar
- F. Preparata and M. I. Shamos. Computational Geometry, Springer-Verlag, 1985.Google Scholar