Q2591189

From Wikidata
Jump to: navigation, search

Smallest-circle problem (Q2591189)[edit]

a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane [edit]

Also known as:
  • minimum covering circle problem
[edit]

Statements