Parallel Enclosing Circle Algorithm
Jump to navigation
Jump to search
| 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
