مسئله کوچکترین دایره
Sign in to saveAlso known as minimum covering circle problem
mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane
In the Vinony graph
Vinony's link graph records 24 inbound references to مسئله کوچکترین دایره, and connects out to bounding sphere, plane and time complexity.
It is catalogued under topics including Circles, Combinatorial optimization and Computational geometry.
Vinony links it to 7 Wikipedia language editions.
Wikidata facts
Show 1 more fact
- Commons category
- Smallest circle problem
via Wikidata · CC0
Connections
bounding sphere
Entity
plane
Entity
time complexity
Entity
triangle
Entity
International Standard Book Number
Entity
C
Entity
circle
Entity
set
Entity
line
Entity
point
Entity
diameter
Entity
radius
Entity
digital object identifier
Entity
dimension
Entity
Fortran
Entity
factorial
Entity
line segment
Entity
tetrahedron
Entity
empty set
Entity
subset
Entity