Abstract
In this paper, two sufficient conditions for identifying a subgraph ofminimum weight triangulation of a planar point set are presented. Theseconditions are based on local geometric properties of an edge to beidentified. Unlike the previous known sufficient conditions for identifyingsubgraphs, such as Keil‘sβ-skeleton and Yang and Xu‘s double circles, The localgeometric requirement in our conditions is not necessary symmetric withrespect to the edge to be identified. The identified subgraph is differentfrom all the known subgraphs including the newly discovered subgraph:so-called the intersection of local-optimal triangulations by Dickerson etal. An O(n3) time algorithm for finding this subgraph from a set ofn points is presented.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
O. Aichholzer, F. Aurenhammer, G. Rote, and M. Tachwer, “Triangulations Intersect Nicely” Proc. 11th Ann. Symp. on Computational Geometry, Vancouver, B.C., Association for Computing Machinery, 1995, pp. 220–229.
E. Anagnostou and D. Corneil, “Polynomial time instances of the minimum weight triangulation problem,” Computational Geometry: Theory and Applications, vol. 3, pp. 247–259, 1993.
S.-W. Cheng and Y.-F. Xu,Constrained Independence System and Triangulations of Planar Point Sets, in D.-Z. Du, and Ming Li (Eds.), “Computing and Combinatorics,” Proc. First Ann. Int. Conf., COCOON’95, LNCS 959, Springer-Verlag, 1995, pp. 41–50.
S.-W. Cheng, M. Golin, and J. Tsang, “Expected Case Analysis of b-skeletons with Applications to the Construction of Minimum Weight Triangulations,” CCCG Conference Proceedings, P.Q., Canada, 1995, pp. 279–284.
S.-W. Cheng and Y.-F. Xu, “Approaching the Largest β-Skeleton within the Minimum weight Triangulation,” Proc. 12th Ann. Symp. Computational Geometry, Philadelphia, Association for Computing Machinery, 1996.
M.T. Dickerson and M.H. Montague, “The Exact Minimum Weight Triangulation,” Proc. 12th Ann. Symp. Computational Geometry, Philadelphia, Association for Computing Machinery, 1996.
M. Garey and D. Johnson, “Computer and Intractability,” A Guide to the Theory of NP-Completeness, Freeman, 1979.
P.D. Gilbert, “New Results in Planar Triangulations,” TR-850, University of Illinois Coordinated Science Lab, 1979.
L. Heath and S. Pemmarajiu, “New results for the minimum weight triangulation problem,” Virginia Polytechnic Institute and State University, Dept. of Computer Science, TR 92-30, 1992.
J.M. Keil, “Computing a subgraph of the minimum weight triangulation,” Computational Geometry: Theory and Applications, vol. 4, pp. 13–26, 1994.
G. Klinesek, “Minimal triangulations of polygonal domains,” Ann. Discrete Math., vol. 9, pp. 121–123, 1980.
A. Lingas, “A new heuristic for the minimum weight triangulation,” SIAM Journal of Algebraic and Discrete Methods, vol, 8, pp. 4–658, 1987.
H. Meijer and D. Rappaport, “Computing the minimum weight triangulation of a set of linearly ordered points,” Information Processing Letters, vol. 42, pp. 35–38, 1992.
A. Mirzain, C. Wang, and Y. Xu, “On Stable Line Segments in Triangulations,” Proceedings of 8th CCCG, Ottawa, 1996, pp. 68–73.
Y. Xu and D. Zhou, “Improved heuristics for the minimum weight triangulation,” Acta Mathematics Applicatae Sinica, vol. 11, no.4, pp. 359–368, 1995.
B. Yang, Y. Xu, and Z. You, “A Chain Decomposition Algorithm for the Proof of a Property on Minimum Weight Triangulations,” Proc. 5th International Symposium on Algorithms and Computation (ISAAC’94), LNCS 834, Springer-Verlag, 1994, pp. 423–427.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Wang, C.A., Chin, F. & Xu, YF. A New Subgraph of Minimum Weight Triangulations. Journal of Combinatorial Optimization 1, 115–127 (1997). https://doi.org/10.1023/A:1009796113861
Issue Date:
DOI: https://doi.org/10.1023/A:1009796113861