Optimal construction of the city Voronoi diagram - Extended abstract

被引:0
|
作者
Bae, Sang Won [1 ]
Kim, Jae-Hoon [2 ]
Chwa, Kyung-Yong [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Div Comp Sci, Dept EECS, Taejon 305701, South Korea
[2] Pusan Univ Foreign Studies, Div Comp Engn, Busan, South Korea
来源
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We address proximity problems in the presence of roads on the L, plane. More specifically, we present the first optimal algorithm for constructing the city Voronoi diagram. We apply the continuous Dijkstra paradigm to obtain an optimal algorithm for building a shortest path map for a given source, and then it extends to that for the city Voronoi diagram. Moreover, the algorithm applies to other generalized situations including metric spaces induced by roads and obstacles together.
引用
收藏
页码:183 / +
页数:2
相关论文
共 50 条