Near-Linear Time Algorithm for the Chamfer Distance

Ainesh Bakshi, Piotr Indyk, Rajesh Jayaram, Sandeep Silwal, Erik Waingarten
2/12/2026

No confident code implementation found for this paper. 2 possible matches can be shown below.

DOISemantic Scholar

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

C2KD: Bridging the Modality Gap for Cross-Modal Knowledge Distillation

94% match2026

Warping the Space: Weight Space Rotation for Class-Incremental Few-Shot Learning

93% match1 repo212026

Quasi-Monte Carlo Features for Kernel Approximation

92% match2026

Pseudoinverse-Guided Diffusion Models for Inverse Problems

92% match1 repo2026

Discriminator-Guided Embodied Planning for LLM Agent

92% match2026

Neuro-Symbolic Data Generation for Math Reasoning

92% match2026

Cite this paper

@article{bakshi2026nearlinear,
  title  = {Near-Linear Time Algorithm for the Chamfer Distance},
  author = {Ainesh Bakshi and Piotr Indyk and Rajesh Jayaram and Sandeep Silwal and Erik Waingarten},
  year   = {2026},
  doi    = {10.52202/075280-2918},
  url    = {https://doi.org/10.52202/075280-2918},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/0f07ccbcc4330cde77f2eea8e2a9cb1659ab524e.svg)](https://codeofpaper.com/paper/0f07ccbcc4330cde77f2eea8e2a9cb1659ab524e)

Discussion