No-collision transportation maps

DOI10.1007/s10915-020-01143-xzbMath1433.49058arXiv1912.02317OpenAlexW3006154770WikidataQ114829981 ScholiaQ114829981MaRDI QIDQ2302392

Alexander Iannantuono, Levon Nurbekyan, Adam M. Oberman

Publication date: 26 February 2020

Published in: Journal of Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.02317

zbMATH Keywords

optimal transportation\(k-d\)binary-space-partitioning treesno-collision transportation maps

Mathematics Subject Classification ID

Geometric measure and integration theory, integral and normal currents in optimization (49Q15)

Related Items (1)

Applications of No-Collision Transportation Maps in Manifold Learning

Uses Software

• GitHub
• POT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational Optimal Transport: With Applications to Data Science
• Contributions to the theory of convex bodies
• Time bounds for selection
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• A fast approach to optimal transport: the back-and-forth method
• Algorithms for dynamic geometric problems over data streams
• Image coding by adaptive tree-structured segmentation
• Stabilized Sparse Scaling Algorithms for Entropy Regularized Transport Problems
• Remarks on a Multivariate Transformation
• Optimal Transport

This page was built for publication: No-collision transportation maps