VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE
From MaRDI portal
Publication:5470167
DOI10.1142/S0218195906001963zbMath1122.52007MaRDI QIDQ5470167
Publication date: 29 May 2006
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Programming involving graphs or networks (90C35) Computational aspects related to convexity (52B55) Traffic problems in operations research (90B20)
Related Items (7)
Abstract Voronoi diagrams revisited ⋮ PARABOLA SEPARATION QUERIES AND THEIR APPLICATION TO STONE THROWING ⋮ Quickest path queries on transportation network ⋮ CONSTRUCTING OPTIMAL HIGHWAYS ⋮ OPTIMAL CONSTRUCTION OF THE CITY VORONOI DIAGRAM ⋮ ABSTRACT VORONOI DIAGRAMS WITH DISCONNECTED REGIONS ⋮ On the complexity of higher order abstract Voronoi diagrams
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized incremental construction of abstract Voronoi diagrams
- On the construction of abstract Voronoi diagrams
- Voronoi diagram for services neighboring a highway
- Concrete and abstract Voronoi diagrams
- Casting a polyhedron with directional uncertainty
- Quickest paths, straight skeletons, and the city Voronoi diagram
- ``The big sweep: On the power of the wavefront approach to Voronoi diagrams
- PLANAR POINT LOCATION REVISITED
- The weighted region problem
This page was built for publication: VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE