Matches in DBpedia 2015-10 for { ?s ?p "The smallest-circle problem or minimum covering circle problem is a mathematical 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."@en }
Showing triples 1 to 1 of
1
with 100 triples per page.
- Smallest-circle_problem comment "The smallest-circle problem or minimum covering circle problem is a mathematical 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.".