CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER

DOI10.1142/S0218195908002623zbMath1188.65019MaRDI QIDQ3527435

Robert Görke, Chan-Su Shin, Alexander Wolff

Publication date: 29 September 2008

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

zbMATH Keywords

algorithmManhattan metricstraight skeletonclosest pairtransportation networkwavefront expansioncity Voronoi diagramminimization query

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (5)

Locating a single facility and a high-speed line ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ Optimal location of transportation devices ⋮ Quickest path queries on transportation network ⋮ Highway hull revisited

Cites Work

• Voronoi diagram for services neighboring a highway
• Ray shooting, depth orders and hidden surface removal
• Quickest paths, straight skeletons, and the city Voronoi diagram
• Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
• The Discrete Geodesic Problem
• Path Planning in 0/1/∞ Weighted Regions with Applications
• The weighted region problem

This page was built for publication: CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER