Even faster algorithm for the Chamfer distance

DOI10.4230/LIPICS.ICALP.2025.76MaRDI QIDQ7363159zbMATH OpenFDO

Authors Ying Feng, Piotr Indyk

Publication date 29 September 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ICALP.2025.76

Mathematics Subject Classification ID

Theory of software (68Nxx) Theory of computing (68Qxx)

Cites work

• Geometric approximation algorithms
• scientific article; zbMATH DE number 1263219 (Why is no real title available?)
• scientific article; zbMATH DE number 1559575 (Why is no real title available?)
• Optimal data-dependent hashing for approximate near neighbors
• Stable distributions, pseudorandom generators, embeddings, and data stream computation
• Time bounds for selection
• Well-separated pair decomposition in linear time?

This page was built for publication: Even faster algorithm for the Chamfer distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363159)