Error-controlled truncation, R-tree queries, multilevel hierarchies, and epsilon scheduling make large-scale finite-element entropy-regularized semi-discrete optimal transport practical.
Minkowski-type theorems and least-squares clustering
1 Pith paper cite this work, alongside 212 external citations. Polarity classification is still indexing.
1
Pith paper citing it
212
external citations · OpenAlex
citation-role summary
background 1
citation-polarity summary
fields
math.NA 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Efficient Numerical Strategies for Entropy-Regularized Semi-Discrete Optimal Transport
Error-controlled truncation, R-tree queries, multilevel hierarchies, and epsilon scheduling make large-scale finite-element entropy-regularized semi-discrete optimal transport practical.