← Search

Eva Szilagyi

2 accepted papers

2025

Fully Dynamic Algorithms for Chamfer Distance

NeurIPS 2025poster

We study the problem of computing Chamfer distance in the fully dynamic setting, where two set of points $A, B \subset \mathbb{R}^{d}$, each of size up to $n$, dynamically evolve through point insertions or deletions and the goal is to efficiently maintain an approximation to $dist_{\mathrm{CH}}(A,B…

Cited by 0SourceScholar
2025

Fully Dynamic Euclidean Bi-Chromatic Matching in Sublinear Update Time

ICML 2025oral

We consider the Euclidean bi-chromatic matching problem in the dynamic setting, where the goal is to efficiently process point insertions and deletions while maintaining a high-quality solution. Computing the minimum cost bi-chromatic matching is one of the core problems in geometric optimization th…

Cited by 0SourcePDFScholar