Concept information
Término preferido
smallest-circle problem
Definición
-
The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing 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.
(Wikipedia, The Free Encyclopedia, https://en.wikipedia.org/wiki/Smallest-circle_problem)
Concepto genérico
Etiquetas alternativas
- bounding circle problem
- least bounding circle problem
- minimum covering circle problem
- smallest enclosing circle problem
En otras lenguas
-
francés
-
cercle minimum
-
problème du cercle englobant minimum
URI
http://data.loterre.fr/ark:/67375/PSR-BFCGXH26-W
{{label}}
{{#each values }} {{! loop through ConceptPropertyValue objects }}
{{#if prefLabel }}
{{/if}}
{{/each}}
{{#if notation }}{{ notation }} {{/if}}{{ prefLabel }}
{{#ifDifferentLabelLang lang }} ({{ lang }}){{/ifDifferentLabelLang}}
{{#if vocabName }}
{{ vocabName }}
{{/if}}