Parallel Enclosing Circle Algorithm

From edegan.com
Revision as of 15:25, 31 July 2017 by OliverC (talk | contribs)
Jump to navigation Jump to search


McNair Project
Parallel Enclosing Circle Algorithm
Project logo 02.png
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.


Git repository: https://localhost/codebase/Repository/OliverEnclosingCircle

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

Retrieved from "http://www.edegan.com/mediawiki/index.php?title=Parallel_Enclosing_Circle_Algorithm&oldid=19600"