146
edits
Changes
Jump to navigation
Jump to search
Enclosing Circle Algorithm (Rework) (view source)
Revision as of 15:54, 23 June 2017
, 15:54, 23 June 2017no edit summary
==Drawbacks==
Is not the optimal solution as number of points increases, but an approximation
=Logical Enclosing Circle=
==Location==
The python script is located in :
E:\McNair\Projects\Accelerators\Enclosing_Circle\Enclosing_Circle\EnclosingCircleRemake2.py
==Explanation==
The rationale is to take the furthest point, draw a circle with its nearest n-1 points. <br>
Take the furthest point from the initial point, draw a circle with its nearest n-1 points. <br>
Repeat until all points are enclosed. <br>
==Benefits==
Can plot to google maps <br>
Is faster than brute force <br>
Returns city, circles, year to a tab delimited text file <br>
==Drawbacks==
Really slow for large number of points <br>
Offers an approximate solution that is worse than the Clustering based version <br>
=Brute Force=
