A new asymmetric inclusion region for minimum weight triangulation
Document Type
Article
Publication Date
1-2010
Department
Department of Electrical and Computer Engineering
Abstract
As a global optimization problem, planar minimum weight triangulation problem has attracted extensive research attention. In this paper, a new asymmetric graph called one-sided β-skeleton is introduced. We show that the one-sided circle-disconnected (√ 2 β) -skeleton is a subgraph of a minimum weight triangulation. An algorithm for identifying subgraph of minimum weight triangulation using the one-sided (√ 2 β) -skeleton is proposed and it runs in {O(n4/3+ε+min{κ log n, n 2log n}) time, where κ is the number of intersected segmented between the complete graph and the greedy triangulation of the point set.
Publication Title
Journal of Global Optimization
Recommended Citation
Hu, S.
(2010).
A new asymmetric inclusion region for minimum weight triangulation.
Journal of Global Optimization,
46(1), 63-73.
http://doi.org/10.1007/s10898-009-9409-z
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/4943
