Parallel Enclosing Circle Algorithm
Jump to navigation
Jump to search
Git repository: https://localhost/codebase/Repository/OliverEnclosingCircle
| 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
threshold: the minimum number of data points per city per year to be considered active (default: 20)n: the minimum number of data points that must be included in a circle
Related Pages
- Abhi's Rework (Summer 2017)
- [[Enclosing_Circle_Algorithm|Original Implementation (Spring 2017)]
