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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2010
2010
When I first met Oded Schramm in January 1991 at the University of California, San Diego, he introduced himself as a “Circle… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2006
2006
The invention provides a transparent electrode barrier layer between the metal oxide electrodes and electrochromic layers thereon… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2001
Highly Cited
2001
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
Is this relevant?
2000
2000
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
Is this relevant?
2000
2000
From the geometric study of the elementary cell of hexagonal circle packings—a flower of 7 circles—the class of conformally… Expand
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
1999
1999
  • T. Dubejko
  • Discret. Comput. Geom.
  • 1999
  • Corpus ID: 33088944
Abstract. Convergence results for discrete solutions of Dirichlet problems for Poisson equations are obtained, where discrete… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
We present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) problem: Given a set of n points in the… Expand
Is this relevant?
1993
1993
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
Is this relevant?
Highly Cited
1991
Highly Cited
1991
  • Emo 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
Is this relevant?