Changes

Parallel Enclosing Circle Algorithm (view source)

656 bytes added , 16:25, 31 July 2017

no edit summary

Project directory: <code>E:\McNair\Projects\OliverLovesCircles</code>

== 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 <code>n</code> points.

Thus, multiple circles are allowed and inclusion in multiple circles is possible.

== Parameters ==

* <code>threshold</code>: the minimum number of data points per city per year to be considered active (default: 20)

* <code>n</code>: the minimum number of data points that must be included in a circle

== Related Pages ==

* [[Enclosing_Circle_Algorithm_(Rework)|Abhi's Rework (Summer 2017)]]

* [[Enclosing_Circle_Algorithm|Original Implementation (Spring 2017)]

329

edits