Abstract
Given a set of n points in the plane, it is shown that the csc(2π/7)-skeleton of S is a subgraph of the minimum weight triangulation of S. We improve the results in [2] that the √2-skeleton of S is a subgraph of the minimum weight triangulation of S.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Garey and D. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
J. M. Keil, Computing a subgraph of the minimum weight triangulation, Computational Geometry 4(1994)13–26.
D. G. Kirkpatrick and J. D. Radke, A framework for computational morphology, in: G. T. Toussaint, ed., Computational Geometry (Elsevier, Amsterdam, 1985) 217–248.
B.-T. Yang, Y.-F. Xu and Z.-Y. You, A chain decomposition algorithm for the proof of a property on minimum weight triangulations, in: D.-Z. Du and X.-S. Zhang, eds., Algorithms and Computation, Lecture Notes in Computer Science 834 (Springer-Verlag, Berlin, 1994) 423–427.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yang, BT. (1995). A better subgraph of the minimum weight triangulation. In: Du, DZ., Li, M. (eds) Computing and Combinatorics. COCOON 1995. Lecture Notes in Computer Science, vol 959. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0030865
Download citation
DOI: https://doi.org/10.1007/BFb0030865
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60216-3
Online ISBN: 978-3-540-44733-7
eBook Packages: Springer Book Archive