Using geometry to solve the transportation problem in the plane

DOI10.1007/BF01190848zbMath0837.68117OpenAlexW2062284696MaRDI QIDQ1894300

Pravin M. Vaidya, David S. Atkinson

Publication date: 9 August 1995

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190848

zbMATH Keywords

scalingtransportation problemVoronoi diagrams

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (2)

Matching point sets with respect to the earth mover's distance ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the construction of abstract Voronoi diagrams
• A sweepline algorithm for Voronoi diagrams
• Geometry Helps in Matching
• Intersection and Closest-Pair Problems for a Set of Planar Discs
• Optimal Point Location in a Monotone Subdivision
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Location of a Point in a Planar Subdivision and Its Applications
• Faster Scaling Algorithms for Network Problems

This page was built for publication: Using geometry to solve the transportation problem in the plane