Smallest enclosing circle problem: Difference between revisions
Content added Content deleted
(Created page with "{{draft task}} The '''smallest enclosing circle problem''' (aka '''minimum covering circle problem''', '''bounding circle problem''') is a mathematical problem of computing th...") |
No edit summary |
||
| Line 4: | Line 4: | ||
Initially it was proposed by the English mathematician James Joseph Sylvester in 1857. |
Initially it was proposed by the English mathematician James Joseph Sylvester in 1857. |
||
;Task: |
|||
Find circle of smallest radius containing all of given points. |
Find circle of smallest radius containing all of given points. |
||
Revision as of 22:08, 2 November 2020
Smallest enclosing circle problem is a draft programming task. It is not yet considered ready to be promoted as a complete task, for reasons that should be found in its talk page.
The smallest enclosing circle problem (aka minimum covering circle problem, bounding circle problem) is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.
Initially it was proposed by the English mathematician James Joseph Sylvester in 1857.
- Task
Find circle of smallest radius containing all of given points.
- Circle is defined by it's center and radius;
- Points are defined by their coordinates in n-dimensional space;
- Circle (sphere) contains point when distance between point and circle center <= circle radius.