Reprint of: Optimally solving a transportation problem using Voronoi diagrams

DOI10.1016/j.comgeo.2013.11.003zbMath1282.49040OpenAlexW2018557292MaRDI QIDQ390172

Darius Geiß, Rolf Klein, Günter Rote, Rainer Penninger

Publication date: 22 January 2014

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2013.11.003

zbMATH Keywords

Wasserstein metricMonge-Kantorovich transportation problemEarth mover's distanceVoronoi diagram with additive weights

Mathematics Subject Classification ID

Variational problems in a geometric measure-theoretic setting (49Q20) Collected or selected works; reprintings or translations of classics (01A75) Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17)

Related Items (1)

Constrained clustering via diagrams: a unified theory and its application to electoral district design

Uses Software

• EMD

Cites Work

• Unnamed Item
• Unnamed Item
• The geometry of optimal transportation
• Minkowski-type theorems and least-squares clustering
• Optimally solving a transportation problem using Voronoi diagrams
• Geometry Helps in Matching
• Optimal Transport

This page was built for publication: Reprint of: Optimally solving a transportation problem using Voronoi diagrams