146
edits
Changes
Jump to navigation
Jump to search
no edit summary
E:\McNair\Software\CodeBase\New Implement of Enclosing Circle (Constrained K Means, Smallest Circle)
==6/9/2017==Wrote up the code for the new algorithm. It runs blazing fast. <br>We are worried about the optimality of the solution. I don't take into account border points. <br>These are points that could be shared by circles. An idea is to add border points into both clusters, then run the smallest enclosing circle on those sets of points. <br>I'll include a full Algorithm write-up on Monday once I have all the kinks worked out.
