Skip to search formSkip to main contentSkip to account menu

Smallest-circle problem

Known as: Minimal bounding circle, Minimal enclosing circle, Smallest circle problem 
The smallest-circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this article I work with the presupposition that the time has arrived that the Belhar Confession should be detached from… 
2014
2014
Let S be a set of n points in the plane. We present a method where, using O(n log 2 n) time and space, S can be pre-processed… 
2013
2013
Let S be a set of n points in the plane. We present data structures that solve range-aggregate query problems on three geometric… 
2008
2008
  • Z. Hai
  • 2008
  • Corpus ID: 204019308
By analyzing the moire fringe of two concentric circle gratings,the authors proposed a measure method of two-dimensional plane… 
2008
2008
This article is about the origin, amplification and evolution of the major satellite DNA of South American rodents known… 
2001
2001
1987
1987
rpHROUGHOUT THE EIGHTEENTH CENTURY, strong links existed 1 between the presbyterians of Scotland and Ireland. But there werc… 
1954
1954