This repo compares different algorithms that find the closest pair in a set of points.
Preliminary results were executed unoptimized with points consisting of f64 numbers. The results show the strong quadratic increase of the brute force alogrithm, the flatter curve of divide and conquer and sweep line, as well as the strongly fluctuating curve of the grid alogrithm.
generated from emilk/eframe_template
-
Notifications
You must be signed in to change notification settings - Fork 0
This repo compares different algorithms that find the closest pair in a set of points.
Niki123456123456/closest_pair
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
This repo compares different algorithms that find the closest pair in a set of points.