Name
Title | ||
|---|---|---|
Shortest paths and voronoi diagrams with transportation networks under general distances |
Abstract | ||
|---|---|---|
Transportation networks model facilities for fast movement on the plane. A transportation network, together with its underlying distance, induces a new distance. Previously, only the Euclidean and the L1 distances have been considered as such underlying distances. However, this paper first considers distances induced by general distances and transportation networks, and present a unifying approach to compute Voronoi diagrams under such a general setting. With this approach, we show that an algorithm for convex distances can be easily obtained. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1007/11602613_100 | ISAAC |
Keywords | Field | DocType |
transportation network,transportation networks model facility,voronoi diagram,shortest path,unifying approach,general setting,general distance,convex distance,underlying distance,new distance,l1 distance | Flow network,Discrete mathematics,Combinatorics,Shortest path problem,Convex body,Computer science,Regular polygon,Voronoi diagram,Euclidean geometry | Conference |
Volume | ISSN | ISBN |
3827 | 0302-9743 | 3-540-30935-7 |
Citations | PageRank | References |
10 | 0.71 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sang Won Bae | 1 | 189 | 31.53 |
| Kyung-Yong Chwa | 2 | 919 | 97.10 |