Changes

Enclosing Circle Algorithm (view source)

564 bytes added , 18:08, 14 February 2017

no edit summary

=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=

479

edits