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.
2019
2019
A novel approach that combines visible light communication (VLC) with unmanned aerial vehicles (UAVs) to simultaneously provide… 
2016
2016
In this paper we show that most sequential randomized incremental algorithms are in fact parallel. We consider several random… 
Highly Cited
2013
Highly Cited
2013
The introduction of mobile elements has created a new dimension to reduce and balance the energy consumption in wireless sensor… 
2010
2010
When I first met Oded Schramm in January 1991 at the University of California, San Diego, he introduced himself as a “Circle… 
Highly Cited
2010
Highly Cited
2010
In this paper we address the problem of segmenting a trajectory such that each segment is in some sense homogeneous. We formally… 
Highly Cited
2006
Highly Cited
2006
  • F. NielsenR. Nock
  • Canadian Conference on Computational Geometry
  • 2006
  • Corpus ID: 7570507
Highly Cited
2000
Highly Cited
2000
Three methods are described for exploring a continuous unknown planar region by a group of robots having limited sensors and no… 
2000
2000
From the geometric study of the elementary cell of hexagonal circle packings—a flower of 7 circles—the class of conformally… 
Highly Cited
1991
Highly Cited
1991
  • E. Welzl
  • New Results and New Trends in Computer Science
  • 1991
  • Corpus ID: 17569809
A simple randomized algorithm is developed which computes the smallest enclosing disk of a finite set of points in the plane in…