Voronoi diagrams and arrangements
Discrete & Computational Geometry
The weighted region problem: finding shortest paths through a weighted planar subdivision
Journal of the ACM (JACM)
On the construction of abstract Voronoi diagrams
Discrete & Computational Geometry
Shortest paths among obstacles in the plane
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Randomized incremental construction of abstract Voronoi diagrams
Computational Geometry: Theory and Applications
Proceedings of the fourteenth annual symposium on Computational geometry
Folding flat silhouettes and wrapping polyhedral packages: new results in computational origami
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Motorcycle graphs and straight skeletons
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Straight Skeletons for General Polygonal Figures in the Plane
COCOON '96 Proceedings of the Second Annual International Conference on Computing and Combinatorics
The transportation metric and related problems
Information Processing Letters
Optimal location of transportation devices
Computational Geometry: Theory and Applications
Optimal Insertion of a Segment Highway in a City Metric
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Two-site Voronoi diagrams in geographic networks
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
All Farthest Neighbors in the Presence of Highways and Obstacles
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
The transportation metric and related problems
Information Processing Letters
Shortest paths and voronoi diagrams with transportation networks under general distances
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Voronoi diagrams with a transportation network on the euclidean plane
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Round-trip voronoi diagrams and doubling density in geographic networks
Transactions on Computational Science XIV
Optimal construction of the city voronoi diagram
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Optimal time-convex hull under the Lp metrics
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.01 |
The city Voronoi diagram is induced by quickest paths, in the L 1 plane speeded up by an isothetic transportation network. We investigate the rich geometric and algorithmic properties of city Voronoi diagrams, and report on their use in processing quickest-path queries.In doing so, we revisit the fact that not every Voronoi-type diagram has interpretations in both the distance model and the wavefront model. Especially, straight skeletons are a relevant example where an interpretation in the former model is lacking. We clarify the relation between these models, and further draw a connection to the bisector-defined abstract Voronoi diagram model, with the particular goal of computing the city Voronoi diagram efficiently.