DC Field | Value | Language |
---|---|---|
dc.contributor.author | Bae S.W. | ko |
dc.contributor.author | Chwa, Kyung Yong | ko |
dc.date.accessioned | 2013-03-03T19:01:25Z | - |
dc.date.available | 2013-03-03T19:01:25Z | - |
dc.date.created | 2012-02-06 | - |
dc.date.created | 2012-02-06 | - |
dc.date.issued | 2004 | - |
dc.identifier.citation | ALGORITHMS AND COMPUTATION, v.3341, pp.101 - 112 | - |
dc.identifier.issn | 0302-9743 | - |
dc.identifier.uri | http://hdl.handle.net/10203/80009 | - |
dc.description.abstract | This paper investigates geometric and algorithmic properties of the Voronoi diagram with a transportation network on the Euclidean plane. With a transportation network, the distance is measured as the length of the shortest (time) path. In doing so, we introduce a needle, a generalized Voronoi site. We present an O(nm(2) log n + m(3) log m) algorithm to compute the Voronoi diagram with a transportation network on the Euclidean plane, where n is the number of given sites and m is the complexity of the given transportation network. | - |
dc.language | English | - |
dc.publisher | SPRINGER-VERLAG BERLIN | - |
dc.subject | CONSTRUCTION | - |
dc.title | Voronoi diagrams with a transportation network on the Euclidean plane | - |
dc.type | Article | - |
dc.identifier.wosid | 000226690300009 | - |
dc.identifier.scopusid | 2-s2.0-33746197694 | - |
dc.type.rims | ART | - |
dc.citation.volume | 3341 | - |
dc.citation.beginningpage | 101 | - |
dc.citation.endingpage | 112 | - |
dc.citation.publicationname | ALGORITHMS AND COMPUTATION | - |
dc.contributor.localauthor | Chwa, Kyung Yong | - |
dc.contributor.nonIdAuthor | Bae S.W. | - |
dc.type.journalArticle | Article; Proceedings Paper | - |
dc.subject.keywordPlus | CONSTRUCTION | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.