A fast, large-scale optimal transport algorithm for holographic beam shaping
This paper presents a fast, large-scale optimal transport algorithm for holographic beam shaping that overcomes the memory and time limitations of existing methods by leveraging the dual formulation and separable cost structure to achieve memory and near-linear time complexity, enabling the solution of megapixel-scale problems in seconds.