The transportation metric and related problems

DOI10.1016/j.ipl.2005.05.005zbMath1185.68787OpenAlexW2000686869MaRDI QIDQ1041811

Yaron Ostrovsky-Berman

Publication date: 4 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.005

zbMATH Keywords

graph algorithmscomputational geometryVoronoi diagramscontinuous Dijkstra

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Proximity graphs inside large weighted graphs ⋮ Weber problems with high-speed lines ⋮ THE HEAVY LUGGAGE METRIC ⋮ All Farthest Neighbors in the Presence of Highways and Obstacles

Cites Work

• Unnamed Item
• Voronoi diagram for services neighboring a highway
• A sweepline algorithm for Voronoi diagrams
• Quickest paths, straight skeletons, and the city Voronoi diagram
• The Discrete Geodesic Problem
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• The weighted region problem
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE

This page was built for publication: The transportation metric and related problems