Voronoi diagrams with transportation on the euclidean plane = 트랜스포테이션 모델에서의 보로노이 다이어그램

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 253
  • Download : 0
With a transportation network, the distance is measured as the length of the shortest (time) path. This thesis investigates geometric and algorithmic properties of the Voronoi diagram with a transportation network on the Euclidean plane. In doing this, we introduce a needle, a generalized Voronoi site. We show that needles are suitable to interpret several proximity properties of the Euclidean plane equipped with a transportation network. We present an $O(nm^2 logn + m^3 logm)$ 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 transportation network. And, if the speed on every road is equal and the given transportation network is isothetic, we can compute the diagram in $O(nmlogn + m^2 logm)$ time with maintaining the linear size of the diagram. Furthermore, a shortest path map with the transportation network can be constructed.
Advisors
Chwa, Kyung-Yongresearcher좌경룡researcher
Description
한국과학기술원 : 전산학전공,
Publisher
한국과학기술원
Issue Date
2004
Identifier
238510/325007  / 020023925
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 전산학전공, 2004.2 , [ v, 44 p. ]

Keywords

TRANSPORTATION NETWORK; VORONOI DIAGRAM; SHORTEST PATH; 최단 거리 경로; 도로망; 보로노이 다이어그램

URI
http://hdl.handle.net/10203/34601
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=238510&flag=dissertation
Appears in Collection
CS-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0