DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Chwa, Kyung-Yong | - |
dc.contributor.advisor | 좌경룡 | - |
dc.contributor.author | Park, Jeong-Hyeon | - |
dc.contributor.author | 박정현 | - |
dc.date.accessioned | 2011-12-13T06:06:33Z | - |
dc.date.available | 2011-12-13T06:06:33Z | - |
dc.date.issued | 2007 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=265042&flag=dissertation | - |
dc.identifier.uri | http://hdl.handle.net/10203/34761 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학전공, 2007.2, [ v, 21 p. ] | - |
dc.description.abstract | With a transportation network, the distance is measured as the length of the shortest (time) path. Algorithms for computing nearest Voronoi diagrams with a transportation network were proposed by Palop and Bae, respectively. But, algorithms for computing farthest Voronoi diagrams for a transportation network is not known. In this thesis, we consider the farthest Voronoi diagram problem for a transportation network on the Euclidean plane. We show that this problem is reduced to farthest color Voronoi diagram problem and present an $O(nm^3 + n^2m^2α(n^2m^2) log nm)$ algorithm to compute. And, we also show that the diagram can have bounded faces and disconnected faces. However, we prove the structural complexity of the diagram is $O(nm^2)$ which predicts the existence of a better algorithm. | eng |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Voronoi Diagram Transportation Network | - |
dc.subject | 보로노이 다이어그램 도로망 | - |
dc.title | Farthest voronoi diagrams for a transportation network on the euclidean plane | - |
dc.title.alternative | 트랜스포테이션 모델에서의 최장 보로노이 다이어그램 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 265042/325007 | - |
dc.description.department | 한국과학기술원 : 전산학전공, | - |
dc.identifier.uid | 020053231 | - |
dc.contributor.localauthor | Chwa, Kyung-Yong | - |
dc.contributor.localauthor | 좌경룡 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.