Voronoi diagram for services neighboring a highway
From MaRDI portal
Publication:1007626
DOI10.1016/S0020-0190(02)00505-7zbMath1162.68725OpenAlexW2009894253MaRDI QIDQ1007626
Ferran Hurtado, Belén Palop, Lihong Ma, Vera Sacristán, Rolf Klein, Christian Icking, Manuel Abellanas, Elmar Langetepe
Publication date: 23 March 2009
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0020-0190(02)00505-7
Related Items
Optimal time-convex hull for a straight-line highway in \(L_p\)-metrics ⋮ Locating a single facility and a high-speed line ⋮ Some Voronoi diagrams that consider consumer behavior analysis ⋮ Proximity graphs inside large weighted graphs ⋮ Round-Trip Voronoi Diagrams and Doubling Density in Geographic Networks ⋮ Farthest-polygon Voronoi diagrams ⋮ CONSTRUCTING THE CITY VORONOI DIAGRAM FASTER ⋮ THE HEAVY LUGGAGE METRIC ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ Exact algorithms for the bottleneck Steiner tree problem ⋮ Locating a Service Facility and a Rapid Transit Line ⋮ The 1-Center and 1-Highway Problem ⋮ Stabbing segments with rectilinear objects ⋮ Optimal location of transportation devices ⋮ The 1-\textsc{Center} and 1-\textsc{Highway} problem revisited ⋮ Tight bound and improved algorithm for farthest-color Voronoi diagrams of line segments ⋮ Quickest path queries on transportation network ⋮ The 1-median and 1-highway problem ⋮ Bichromatic 2-center of pairs of points ⋮ Computing the center region and its variants ⋮ On Exact Solutions to the Euclidean Bottleneck Steiner Tree Problem ⋮ Color Spanning Objects: Algorithms and Hardness Results ⋮ CONSTRUCTING OPTIMAL HIGHWAYS ⋮ VORONOI DIAGRAMS FOR A TRANSPORTATION NETWORK ON THE EUCLIDEAN PLANE ⋮ On exact solutions to the Euclidean bottleneck Steiner tree problem ⋮ PRICING GEOMETRIC TRANSPORTATION NETWORKS ⋮ Highway hull revisited ⋮ The transportation metric and related problems
Uses Software
Cites Work
