There are no files associated with this item.
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.citation.endPage | 219 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 207 | - |
dc.citation.title | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS | - |
dc.citation.volume | 40 | - |
dc.contributor.author | Aronov, Boris | - |
dc.contributor.author | de Berg, Mark | - |
dc.contributor.author | Cheong, Otfried | - |
dc.contributor.author | Gudmundsson, Joachim | - |
dc.contributor.author | Haverkort, Herman | - |
dc.contributor.author | Smid, Michiel | - |
dc.contributor.author | Vigneron, Antoine | - |
dc.date.accessioned | 2023-12-22T08:37:27Z | - |
dc.date.available | 2023-12-22T08:37:27Z | - |
dc.date.created | 2016-06-10 | - |
dc.date.issued | 2008-08 | - |
dc.description.abstract | Given a set S of n points in R(D), and an integer k such that 0 <= k < n, we show that a geometric graph with vertex set S, at most n - 1 + k edges, maximum degree five, and dilation O(n/(k + 1)) can be computed in time O(n log n). For any k, we also construct planar n-point sets for which any geometric graph with n - 1 + k edges has dilation Omega (n/(k + 1)); a slightly weaker statement holds if the points of S are required to be in convex position. (c) 2007 Elsevier B.V. All rights reserved | - |
dc.identifier.bibliographicCitation | COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, v.40, no.3, pp.207 - 219 | - |
dc.identifier.doi | 10.1016/j.comgeo.2007.07.004 | - |
dc.identifier.issn | 0925-7721 | - |
dc.identifier.scopusid | 2-s2.0-84867961523 | - |
dc.identifier.uri | https://scholarworks.unist.ac.kr/handle/201301/19647 | - |
dc.identifier.url | http://www.sciencedirect.com/science/article/pii/S0925772107000740 | - |
dc.identifier.wosid | 000256241900003 | - |
dc.language | 영어 | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.title | Sparse geometric graphs with small dilation | - |
dc.type | Article | - |
dc.description.journalRegisteredClass | scopus | - |
dc.subject.keywordAuthor | dilation | - |
dc.subject.keywordAuthor | spanner | - |
dc.subject.keywordAuthor | geometric network | - |
dc.subject.keywordAuthor | small-dilation spanning tree | - |
dc.subject.keywordPlus | MINIMUM SPANNING-TREES | - |
dc.subject.keywordPlus | POINT SETS | - |
dc.subject.keywordPlus | SPANNERS | - |
dc.subject.keywordPlus | NETWORKS | - |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Tel : 052-217-1404 / Email : scholarworks@unist.ac.kr
Copyright (c) 2023 by UNIST LIBRARY. All rights reserved.
ScholarWorks@UNIST was established as an OAK Project for the National Library of Korea.