Abstract
We present improvements in finding the LMT-skeleton, which is a subgraph of all minimum weight triangulations, independently proposed by Belleville et al, and Dickerson and Montague. Our improvements consist of: (1) A criteria is proposed to identify edges in all minimum weight triangulations, which is a relaxation of the definition of local minimality used in Dickerson and Montague's method to find the LMT-skeleton; (2) A worst-case efficient algorithm is presented for performing one pass of Dickerson and Montague's method (with our new criteria); (3) Improvements in the implementation that may lead to substantial space reduction for uniformly distributed point sets.
Research of the first author is partly supported by the RGC CERG grant HKUST650/95E. Research of the second author is partly supported by the Grant-in-Aid of Ministry of Science, Culture and Education of Japan.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A. Aggarwal, M.M. Klawe, S. Moran, P.W. Shor, and R. Wilber: Geometric applications of a matrix-searching algorithm, Algorithmica, 2 (1987), pp. 195–208.
O. Aichholzer, F. Aurenhammer, S.W. Cheng, N. Katoh, G. Rote, M, Taschwer, and Y.F. Xu, Triangulations intersect nicely, manuscript, 1996.
P. Belleville, M. Keil, M. McAllister, and J. Snoeyink, On computing edges that are in all minimum-weight triangulations, Video Presentation, Symp. Computational Geometry, 1996.
P. Bose, L. Devroye, and W. Evans, Diamonds are not a minimum weight triangulation's best friend, Proceedings of Canadian Conference on Computational Geometry, 1996. See also technical report 96-01, Dept. of Computer Science, Univ. of British Columbia, January 1996.
S.W. Cheng and Y.F. Xu, Approaching the largest β-skeleton within a minimum weight triangulation, Proc. Symp. Computational Geometry, 1996, pp. 196–203.
M.T. Dickerson and M.H. Montague, A (usually?) connected subgraph of minimum weight triangulation, Proc. Symp. Computational Geometry, 1996, pp. 204–213.
M. Golin, Limit theorems for minimum-weight triangulations, other Euclidean functionals, and probabilistic recurrence relations, Proc. Symp. Discrete Algorithms, 1996, pp. 252–260.
L. Heath and S.V. Pemmaraju, New results for the minimum weight triangulation problem, Algorithmica, 12 (1994), pp. 533–552.
J.M. Keil, Computing a subgraph of the minimum weight triangulation, Computational Geometry: Theory and Applications, 4 (1994), pp. 13–26.
C. Levcopoulos and D. Krznaric, Quasi-greedy triangulations approximating the minimum weight triangulation, Proc. Symp. Discrete Algorithms, 1996, pp. 392–401.
C. Levcopoulos and D. Krznaric, A fast heuristic for approximating the minimum weight triangulation, Proc. Scandinavian Workshop on Algorithmic Theory, 1996.
B. Yang, Y. Xu, and Z. You, A chain decomposition algorithm for the proof of a property on minimum weight triangulation, in Proc. International Symposium on Algorithms and Computation, 1994, pp. 423–427.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cheng, SW., Katoh, N., Sugai, M. (1996). A study of the LMT-skeleton. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds) Algorithms and Computation. ISAAC 1996. Lecture Notes in Computer Science, vol 1178. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0009502
Download citation
DOI: https://doi.org/10.1007/BFb0009502
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62048-8
Online ISBN: 978-3-540-49633-5
eBook Packages: Springer Book Archive