File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A new asymmetric inclusion region for minimum weight triangulation

TitleA new asymmetric inclusion region for minimum weight triangulation
Authors
KeywordsInclusion region
Minimum weight triangulation
One-sided β-skeleton
Issue Date2010
Citation
Journal of Global Optimization, 2010, v. 46, n. 1, p. 63-73 How to Cite?
AbstractAs 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. © 2009 Springer Science+Business Media, LLC.
Persistent Identifierhttp://hdl.handle.net/10722/336078
ISSN
2023 Impact Factor: 1.3
2023 SCImago Journal Rankings: 0.743
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorHu, Shiyan-
dc.date.accessioned2024-01-15T08:23:14Z-
dc.date.available2024-01-15T08:23:14Z-
dc.date.issued2010-
dc.identifier.citationJournal of Global Optimization, 2010, v. 46, n. 1, p. 63-73-
dc.identifier.issn0925-5001-
dc.identifier.urihttp://hdl.handle.net/10722/336078-
dc.description.abstractAs 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. © 2009 Springer Science+Business Media, LLC.-
dc.languageeng-
dc.relation.ispartofJournal of Global Optimization-
dc.subjectInclusion region-
dc.subjectMinimum weight triangulation-
dc.subjectOne-sided β-skeleton-
dc.titleA new asymmetric inclusion region for minimum weight triangulation-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1007/s10898-009-9409-z-
dc.identifier.scopuseid_2-s2.0-72449153011-
dc.identifier.volume46-
dc.identifier.issue1-
dc.identifier.spage63-
dc.identifier.epage73-
dc.identifier.eissn1573-2916-
dc.identifier.isiWOS:000272375600005-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats