Defines CDuT and gives an exact quadratic algorithm in 1D plus three approximation algorithms in higher dimensions with runtimes O(mn^{2}ε^{-(d+1)}) and near-quadratic under separation assumptions, plus fine-grained complexity analysis.
Karl Bringmann and André Nusser
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Approximate Algorithms for Chamfer Distance Under Translation
Defines CDuT and gives an exact quadratic algorithm in 1D plus three approximation algorithms in higher dimensions with runtimes O(mn^{2}ε^{-(d+1)}) and near-quadratic under separation assumptions, plus fine-grained complexity analysis.