OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM

DOI10.1142/S021819590900285XzbMath1167.65334OpenAlexW2100870056MaRDI QIDQ3636311

Sang Won Bae, Kyung-Yong Chwa, Jae-Hoon Kim

Publication date: 30 June 2009

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s021819590900285x

zbMATH Keywords

algorithmVoronoi diagramtransportation networktime metriccity metriccontinuous Dijkstra methodshortest travel time path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited ⋮ Quickest path queries on transportation network

Cites Work

• \(L_ 1\) shortest paths among polygonal obstacles in the plane
• Concrete and abstract Voronoi diagrams
• VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE

This page was built for publication: OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM