146
edits
Changes
Jump to navigation
Jump to search
Enclosing Circle Algorithm (Rework) (view source)
Revision as of 15:40, 23 June 2017
, 15:40, 23 June 2017→Step By Step Use
6. your resulting text file and html google plots will be outputted to:
E:\McNair\Software\CodeBase\New Implement of Enclosing Circle (Constrained K Means, Smallest Circle)
== Benefits ==
Is faster than both Brute Force and Logical Enclosing Circle. <br>
Is more accurate than Logical Enclosing Circle. <br>
Can plot to google maps. <br>
Will return a tab delim text file of the following fields: city,year,total area <br>
Good for a large number of points <br>
==Drawbacks==
Is not the optimal solution ans number of points inreases, but an approximation
=Brute Force=
