Definitions from Wikipedia (Smallest-circle problem)

▸ noun:  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.


▸ Words similar to smallest-circle problem
▸ Usage examples for smallest-circle problem

▸ Idioms related to smallest-circle problem
▸ Wikipedia articles (New!)
▸ Words that often appear near smallest-circle problem
▸ Rhymes of smallest-circle problem

▸ Invented words related to smallest-circle problem