7,612
edits
Changes
Jump to navigation
Jump to search
Enclosing Circle Algorithm (view source)
Revision as of 13:47, 21 September 2020
, 13:47, 21 September 2020no edit summary
{{Project|Has project output=Tool|Has sponsor=McNair ProjectsCenter
|Has title=Enclosing Circle Algorithm
|Has owner=Christy Warden, Peter Jalbert,|Has start date=201701January 2017|Has deadline=201704April 2017
|Has keywords=Tool
|Has project status=ActiveSubsume
|Has Image=Red-circle.jpg
}}
Further improvements could implement an early-stopping method to converge to a local optima. <br>
==Comparison to Other Algorithm Visualization ==
The K-Means based algorithm returns the optimal solution, albeit slower <br>
[[File:kmeans comparison.png]][[File:original algorithm.png]] In this example, there are 16 points, with n = 4. <br>The k-means based algorithm doesn't seem to constrain circles to have about 4 points. <br>The previous algorithm seems to search for a point and construct a circle of the n-1 nearest points to construct a circle. <br>This search is dependent on what point is constructed first, since all further search spaces excluded the previously constructed circle. <br> [[File:kmeans random.png]][[File:original algorithm randomhouston.png]] Here again are both algorithms on randomly generated points.
=Brute Force=
