Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Related topics

Related topics

14 relations
1-center problemBounding sphereChebyshev centerClosest string
Expand

Broader (2)

Combinatorial optimizationComputational geometry

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 2
Highly Cited
2013
Highly Cited
2013
Clustering algorithms for maximizing the lifetime of wireless sensor networks with energy-harvesting sensors
Motivated by recent developments in Wireless Sensor Networks (WSNs), we present several efficient clustering algorithms for… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
2006
2006
On the Smallest Enclosing Information Disk
We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
2003
2003
Periodicity and Circle Packings of the Hyperbolic Plane
We prove that given a fixed radius r, the set of isometry-invariant probability measures supported on 'periodic' radius r-circle… Expand
2001
2001
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… Expand
Highly Cited
2001
Highly Cited
2001
Maintaining approximate extent measures of moving points
We present approximation algorithms for maintaining various descriptors of the extent of moving points in Rd. We first describe a… Expand
  • figure 1
  • figure 2
  • figure 3
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… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
1994
1994
Computing the Smallest K-enclosing Circle and Related Problems
Abstract We present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) problem: Given a set of n points… Expand
1993
1993
Computing the Smallest k-Enclosing Circle and Related Problems
We present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) problem: Given a set of n points in the… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
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… Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE