closest_pair_divcon_test

closest_pair_divcon_test, an Octave code which calls closest_pair_divcon(), which uses a divide and conquer method to identify the closest pair of points in a given 2D collection.

Licensing:

The information on this web page is distributed under the MIT license.

Related Data and Programs:

closest_pair_divcon, an Octave code which uses a divide and conquer method to identify the closest pair of points in a given 2D collection.

Source Code:

• closest_pair_divcon_test.m, calls all tests.
• closest_pair_divcon_test.sh, runs all tests.
• closest_pair_divcon_test.txt, the output file.

• closest_pair_divcon_test01.m, solves and times a problem using N points.

• closest_pair_divcon.png, execution time plotted as a function of number of data points.