Enclosing Circle Algorithm
| Enclosing Circle Algorithm | |
|---|---|
| Project Information | |
| Project Title | |
| Start Date | |
| Deadline | |
| Primary Billing | |
| Notes | |
| Has project status | |
| Copyright © 2016 edegan.com. All Rights Reserved. | |
Overview
This program takes in a set of points and the minimum number that should be included inside a unit, and returns circles of the smallest total area which encompass all of the data points. Function make_circle and all of its helper functions were taken from https://www.nayuki.io/res/smallest-enclosing-circle/smallestenclosingcircle.py.
Input: A sequence of pairs of floats or ints, e.g. [(0,5), (3.1,-2.7)].
Output: A triple of floats representing a circle.
Returns the smallest circle that encloses all the given points. Runs in expected O(n) time, randomized.
Algorithm Description
Location
The original script is located in:
E:\McNair\Software\CodeBase\EnclosingCircle.py
Applications
VC Data
The Enclosing Circle Algorithm will be applied to VC data acquired through the SDC Platinum database.
The relevant files are located in:
E:\McNair\Projects\Accelerators\Enclosing_Circle
Current Status: Bug fixes needed in EnclosingCircle.py. The program errors with a key error on line 187 in cases where n is not a multiple of the length of the dataset.
