329
edits
Changes
Jump to navigation
Jump to search
Git repository: https://localhost/codebase/Repository/OliverEnclosingCircle
== Performance Characteristics ==TODO: explain difficulty of port
Parallel Enclosing Circle Algorithm (view source)
Revision as of 11:49, 7 August 2017
, 11:49, 7 August 2017no edit summary
|Is dependent on=Enclosing Circle Algorithm,
}}
Project directory: <code>E:\McNair\Projects\OliverLovesCircles</code>
== Parameters ==
* <code>thresholditerations_per_k</code>: the minimum number of data points per city per year iterations to attempt for each <code>k</code> to be considered active (default: 20)find minimum for that <code>k</code>
* <code>n</code>: the minimum number of data points that must be included in a circle
== Overview ==
TODO: explain range of k
TODO: add initial cut documentation
== Related Pages ==
* [[Enclosing_Circle_Algorithm_(Rework)|Abhi's Rework (Summer 2017)]]
* [[Enclosing_Circle_Algorithm|Original Implementation (Spring 2017)]]
== External Links ==
* [https://rdp.mcnaircenter.org/codebase/Repository/OliverEnclosingCircle Git Repository]
