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)

Related topics

Related topics

14 relations
1-center problemBounding sphereChebyshev centerClosest string

Broader (2)

Combinatorial optimizationComputational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Power Efficient Visible Light Communication With Unmanned Aerial Vehicles
A novel approach that combines visible light communication (VLC) with unmanned aerial vehicles (UAVs) to simultaneously provide… 
2016
2016
Parallelism in Randomized Incremental Algorithms
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
A Progressive Approach to Reducing Data Collection Latency in Wireless Sensor Networks with Mobile Elements
The introduction of mobile elements has created a new dimension to reduce and balance the energy consumption in wireless sensor… 
Highly Cited
2013
Highly Cited
2013
Clustering algorithms for maximizing the lifetime of wireless sensor networks with energy-harvesting sensors
2010
2010
Oded Schramm: From Circle Packing to SLE
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
An algorithmic framework for segmenting trajectories based on spatio-temporal criteria
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
On the Smallest Enclosing Information Disk
  • F. NielsenR. Nock
  • Canadian Conference on Computational Geometry
  • 2006
  • Corpus ID: 7570507
Highly Cited
2000
Highly Cited
2000
MAC Versus PC: Determinism and Randomness as Complementary Approaches to Robotic Exploration of Continuous Unknown Domains
Three methods are described for exploring a continuous unknown planar region by a group of robots having limited sensors and no… 
2000
2000
Conformally Symmetric Circle Packings: A Generalization of Doyle's Spirals
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
Smallest enclosing disks (balls and ellipsoids)
  • 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… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)