closest_pair_divcon


closest_pair_divcon, an Octave 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, an Octave code which uses brute force to solve a 2D version of the closest pair problem.

Reference:

Source Code:


Last revised on 13 August 2024.