A better subgraph of the minimum weight triangulation
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  that the √2-skeleton of S is a subgraph of the minimum weight triangulation of S.
KeywordsComputational geometry minimum weight triangulation point sets Euclidean plane
Unable to display preview. Download preview PDF.
- M. Garey and D. Johnson, Computers and Intractability; A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).Google Scholar
- D. G. Kirkpatrick and J. D. Radke, A framework for computational morphology, in: G. T. Toussaint, ed., Computational Geometry (Elsevier, Amsterdam, 1985) 217–248.Google Scholar
- 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.Google Scholar