Smallest-circle problem (Q2591189)

From Wikidata
Jump to: navigation, search
a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane
  • minimum covering circle problem
[edit]
Language Label Description Also known as
English
Smallest-circle problem
a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane
  • minimum covering circle problem

Statements

[edit]
[edit]
[edit]
[edit]
[edit]
[edit]