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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1991-2016
01219912016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
2010
2010
Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, which… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2006
2006
In this paper, we present a generalization of the smallest enclosing disk problem for point sets lying in Information-geometric… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 5
Is this relevant?
2005
2005
We describe a simple and fast O(n log2 1 ε )-time algorithm for finding a (1 + ε)-approximation of the smallest enclosing disk of… (More)
  • figure 1
  • figure 2
  • table 1
Is this relevant?
2001
2001
We present approximation algorithms for maintaining various descriptors of the extent of moving points in R<sup><i>d</i></sup… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2001
2001
  • Pankaj K. Agarwaly, Sariel Har-Peledz
  • 2001
We present approximation algorithms for maintaining various descriptors of the extent of moving points in R d. We rst describe a… (More)
Is this relevant?
2000
2000
  • Pankaj K. Agarwaly, Sariel Har-Peledz
  • 2000
We present approximation algorithms for maintaining various descriptors of the extent of moving points in R d. We rst describe a… (More)
Is this relevant?
1997
1997
We present an algorithm for computing the discrete 2-center of a set P of n points in the plane; that is, computing two congruent… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 7
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We present an O(n log n)-time algorithm for computing the 2-center of a set S of n points in the plane (that is, a pair of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
A simple randomized algorithm is developed which computes the smallest enclosing disk of a nite set of points in the plane in… (More)
Is this relevant?