File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Triangulations without minimum-weight drawing

TitleTriangulations without minimum-weight drawing
Authors
Wang, CAChin, FYYang, B
Issue Date2000
PublisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/ipl
Citation
Information Processing Letters, 2000, v. 74 n. 5, p. 183-189 How to Cite?
DOI: http://dx.doi.org/10.1016/S0020-0190(00)00067-3
AbstractIt is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy triangulation, minimum-weight triangulation, Delaunay triangulation, etc. Lenhart and Liotta (1997) in their pioneering paper on `drawable' minimum-weight triangulations raised an open problem: `Does every triangulation graph whose skeleton is a forest admit a minimum-weight drawing?' In this paper, we answer this problem by disproving it in the general case and even when the skeleton is restricted to a tree or, in particular, a star.
Persistent Identifierhttp://hdl.handle.net/10722/89122
ISSN
0020-0190
2023 Impact Factor: 0.7
2023 SCImago Journal Rankings: 0.404
ISI Accession Number ID
WOS:000087825300001
References
References in Scopus

 

DC FieldValueLanguage
dc.contributor.authorWang, CAen_HK
dc.contributor.authorChin, FYen_HK
dc.contributor.authorYang, Ben_HK
dc.date.accessioned2010-09-06T09:52:39Z-
dc.date.available2010-09-06T09:52:39Z-
dc.date.issued2000en_HK
dc.identifier.citationInformation Processing Letters, 2000, v. 74 n. 5, p. 183-189en_HK
dc.identifier.issn0020-0190en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89122-
dc.description.abstractIt is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy triangulation, minimum-weight triangulation, Delaunay triangulation, etc. Lenhart and Liotta (1997) in their pioneering paper on `drawable' minimum-weight triangulations raised an open problem: `Does every triangulation graph whose skeleton is a forest admit a minimum-weight drawing?' In this paper, we answer this problem by disproving it in the general case and even when the skeleton is restricted to a tree or, in particular, a star.en_HK
dc.languageengen_HK
dc.publisherElsevier BV. The Journal's web site is located at http://www.elsevier.com/locate/iplen_HK
dc.relation.ispartofInformation Processing Lettersen_HK
dc.rightsInformation Processing Letters. Copyright © Elsevier BV.en_HK
dc.titleTriangulations without minimum-weight drawingen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=0020-0190&volume=74&issue=5-6&spage=183&epage=189&date=2000&atitle=Triangulations+without+Minimum-Weight+Drawingen_HK
dc.identifier.emailChin, FY:chin@cs.hku.hken_HK
dc.identifier.authorityChin, FY=rp00105en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1016/S0020-0190(00)00067-3en_HK
dc.identifier.scopuseid_2-s2.0-0033713821en_HK
dc.identifier.hkuros50413en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-0033713821&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume74en_HK
dc.identifier.issue5en_HK
dc.identifier.spage183en_HK
dc.identifier.epage189en_HK
dc.identifier.isiWOS:000087825300001-
dc.publisher.placeNetherlandsen_HK
dc.identifier.scopusauthoridWang, CA=7501646353en_HK
dc.identifier.scopusauthoridChin, FY=7005101915en_HK
dc.identifier.scopusauthoridYang, B=22137306700en_HK
dc.identifier.issnl0020-0190-

Export via OAI-PMH Interface in XML Formats

OR

Export to Other Non-XML Formats