Smallest-circle problem
id:
smallest-circle-problem-184-8290572
title:
Smallest-circle problem
text:
The smallest-circle problem is a computational geometry problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane. The corresponding problem in n-dimensional space, the smallest bounding sphere problem, is to compute the smallest n-sphere that contains all of a given set of points. The smallest-circle problem was initially proposed by the English mathematician James Joseph Sylvester in 1857. The smallest-circle problem in the plane is an example o
brand slug:
wiki
category slug:
encyclopedia
description:
Finding the smallest circle that contains all given points
original url:
https://en.wikipedia.org/wiki/Smallest-circle_problem
date created:
2007-11-22T05:52:41Z
date modified:
2024-09-07T14:53:55Z
main entity:
{"identifier":"Q2591189","url":"https://www.wikidata.org/entity/Q2591189"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/9/9c/Smallest_circle_problem.svg","width":800,"height":800}
fields total:
13
integrity:
16