Changes

Jump to navigation Jump to search
no edit summary
8) Choose the scheme that resulted in the smallest total area.
=Brute Force=
==Explanation==
1) Final all combinations of two points in the total data set.
 
2) For each of these combinations, draw a circle and figure out what other points are contained in a circle around those two points. If the circle contains at least n points, add it to a set of valid circles. There are Number of Points choose 2 possible circles.
 
3) Combine the valid circles in all possible ways and see if the resulting scheme contains all of the points. If it does, add it to a set of valid schemes. I believe that the number of ways to do this is the sum from i = 1 to i = number of valid circles Number of Circles choose i.
 
4) Iterate through the valid schemes and calculate the areas of the schemes.
 
5) Return the minimum area.
=Applications=
272

edits

Navigation menu