Computing the exact bijection of the optimal transport (OT) problem between very large point sets is completely untractable… In our SIGGRAPH Asia 2025 paper: “BSP-OT: Sparse transport plans between discrete measures in log-linear time” we get one with typically 1% of error in a few seconds on CPU!