Shortest paths and Voronoi diagrams with transportation networks under general distances

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 L-1 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.
Publisher
SPRINGER-VERLAG BERLIN
Issue Date
2005
Language
ENG
Keywords

CONSTRUCTION

Citation

LECTURE NOTES IN COMPUTER SCIENCE, v.3827, pp.1007 - 1018

ISSN
0302-9743
URI
http://hdl.handle.net/10203/87372
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 122
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 8 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0