File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A new subgraph of minimum weight triangulations

TitleA new subgraph of minimum weight triangulations
Authors
Issue Date1997
PublisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1382-6905
Citation
Journal Of Combinatorial Optimization, 1997, v. 1 n. 2, p. 115-127 How to Cite?
AbstractIn this paper, two sufficient conditions for identifying a subgraph of minimum weight triangulation of a planarpoint set are presented. These conditions are based on local geometric properties of an edge to be identified. Unlike the previous known sufficient conditions for identifying subgraphs, such as Keil's β-skeleton and Yang and Xu's double circles, The local geometric requirement in our conditions is not necessary symmetric with respect to the edge to be identified. The identified subgraph is different from all the known subgraphs including the newly discovered subgraph: so-called the intersection of local-optimal triangulations by Dickerson et al. An O(n3) time algorithm for finding this subgraph from a set of n points is presented. © 1997 Kluwer Academic Publishers.
Persistent Identifierhttp://hdl.handle.net/10722/88919
ISSN
2015 Impact Factor: 1.08
2015 SCImago Journal Rankings: 1.093
References

 

DC FieldValueLanguage
dc.contributor.authorWang, CANen_HK
dc.contributor.authorChin, Fen_HK
dc.contributor.authorXu, YFen_HK
dc.date.accessioned2010-09-06T09:50:08Z-
dc.date.available2010-09-06T09:50:08Z-
dc.date.issued1997en_HK
dc.identifier.citationJournal Of Combinatorial Optimization, 1997, v. 1 n. 2, p. 115-127en_HK
dc.identifier.issn1382-6905en_HK
dc.identifier.urihttp://hdl.handle.net/10722/88919-
dc.description.abstractIn this paper, two sufficient conditions for identifying a subgraph of minimum weight triangulation of a planarpoint set are presented. These conditions are based on local geometric properties of an edge to be identified. Unlike the previous known sufficient conditions for identifying subgraphs, such as Keil's β-skeleton and Yang and Xu's double circles, The local geometric requirement in our conditions is not necessary symmetric with respect to the edge to be identified. The identified subgraph is different from all the known subgraphs including the newly discovered subgraph: so-called the intersection of local-optimal triangulations by Dickerson et al. An O(n3) time algorithm for finding this subgraph from a set of n points is presented. © 1997 Kluwer Academic Publishers.en_HK
dc.languageengen_HK
dc.publisherSpringer Verlag Dordrecht. The Journal's web site is located at http://springerlink.metapress.com/openurl.asp?genre=journal&issn=1382-6905en_HK
dc.relation.ispartofJournal of Combinatorial Optimizationen_HK
dc.titleA new subgraph of minimum weight triangulationsen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1382-6905&volume=1&spage=115&epage=127&date=1997&atitle=A+New+Subgraph+of+Minimum+Weight+Triangulationsen_HK
dc.identifier.emailChin, F:chin@cs.hku.hken_HK
dc.identifier.authorityChin, F=rp00105en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1023/A:1009796113861-
dc.identifier.scopuseid_2-s2.0-0343736947en_HK
dc.identifier.hkuros25257en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0343736947&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume1en_HK
dc.identifier.issue2en_HK
dc.identifier.spage115en_HK
dc.identifier.epage127en_HK
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridWang, CAN=8895045600en_HK
dc.identifier.scopusauthoridChin, F=7005101915en_HK
dc.identifier.scopusauthoridXu, YF=7406449677en_HK

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats