Difference between revisions of "Parallel Enclosing Circle Algorithm"
Jump to navigation
Jump to search
| Line 7: | Line 7: | ||
|Is dependent on=Enclosing Circle Algorithm, | |Is dependent on=Enclosing Circle Algorithm, | ||
}} | }} | ||
| − | + | ||
Project directory: <code>E:\McNair\Projects\OliverLovesCircles</code> | Project directory: <code>E:\McNair\Projects\OliverLovesCircles</code> | ||
| Line 20: | Line 20: | ||
== Parameters == | == Parameters == | ||
| − | * <code> | + | * <code>iterations_per_k</code>: the number of iterations to attempt for each <code>k</code> to find minimum for that <code>k</code> |
* <code>n</code>: the minimum number of data points that must be included in a circle | * <code>n</code>: the minimum number of data points that must be included in a circle | ||
== Overview == | == Overview == | ||
| − | TODO | + | TODO: explain range of k |
| − | + | TODO: explain difficulty of port | |
| − | TODO | + | TODO: add initial cut documentation |
== Related Pages == | == Related Pages == | ||
| Line 35: | Line 35: | ||
* [[Enclosing_Circle_Algorithm_(Rework)|Abhi's Rework (Summer 2017)]] | * [[Enclosing_Circle_Algorithm_(Rework)|Abhi's Rework (Summer 2017)]] | ||
* [[Enclosing_Circle_Algorithm|Original Implementation (Spring 2017)]] | * [[Enclosing_Circle_Algorithm|Original Implementation (Spring 2017)]] | ||
| + | |||
| + | == External Links == | ||
| + | |||
| + | * [https://rdp.mcnaircenter.org/codebase/Repository/OliverEnclosingCircle Git Repository] | ||
Revision as of 11:49, 7 August 2017
| Parallel Enclosing Circle Algorithm | |
|---|---|
| Project Information | |
| Project Title | Parallel Enclosing Circle Algorithm |
| Owner | Oliver Chang |
| Start Date | July 31, 2017 |
| Deadline | August 4, 2017 |
| Primary Billing | |
| Notes | |
| Has project status | Active |
| Is dependent on | Enclosing Circle Algorithm |
| Copyright © 2016 edegan.com. All Rights Reserved. | |
Project directory: E:\McNair\Projects\OliverLovesCircles
The Problem
Note that this is not the classical enclosing circle algorithm.
Rather, we seek to minimize the sum of enclosing circles containing at least n points.
Thus, multiple circles are allowed and inclusion in multiple circles is possible.
Parameters
iterations_per_k: the number of iterations to attempt for eachkto find minimum for thatkn: the minimum number of data points that must be included in a circle
Overview
TODO: explain range of k
TODO: explain difficulty of port
TODO: add initial cut documentation
