Skip to content
#

anil-maheshwary

Star

Here is 1 public repository matching this topic...

ThangMinhCao / closest-pair-doubling

Star 1

The implementation in C++ of the closest-pair doubling algorithm which finds the smallest distance between two points in a metric space in O(n log n) time without directly using the points' coordinates.

computational-geometry computational-geometry-algorithms implementation-of-algorithms closest-pair-of-points implementation-of-research-paper doubling-metrics michiel-smid wolfgang-mulzer anil-maheshwary
  • Updated Sep 28, 2020
  • C++

Improve this page

Add a description, image, and links to the anil-maheshwary topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the anil-maheshwary topic, visit your repo's landing page and select "manage topics."

Learn more