closest_pair_divcon
closest_pair_divcon,
a MATLAB code which
uses a divide and conquer approach to find the closest pair of points
in a given 2D collection.
Licensing:
The information on this web page is distributed under the MIT license.
Languages:
closest_pair_divcon is available in
a MATLAB version and
an Octave version.
Related Data and Programs:
closest_pair_divcon_test
closest_pair_brute,
a MATLAB code which
uses brute force to solve a 2D version of
the closest pair problem.
Reference:
-
Cleve Moler,
https://blogs.mathworks.com/cleve/2024/03/28/closest-pair-of-points-problem/
Closest pair of points problem,
28 March 2024.
Source Code:
-
brute.m,
uses brute force to find the closest pair.
-
center.m,
helps the divide and conquer method by checking a center strip.
-
divcon.m,
uses divide and conquer to find the closest pair.
Last revised on 13 August 2024.