The smallest-circle problem or minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of aâ€¦Â (More)

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)

Is this relevant?

2010

2010

- Yunyue Lin, Chase Qishi Wu, Xiaoshan Cai, Xiaojiang Du, Ki-Hyeon Kwon
- IJDSN
- 2010

Data transmission from sensor nodes to a base station or a sink node often incurs significant energy consumption, whichâ€¦Â (More)

Is this relevant?

2006

2006

- Frank Nielsen, Richard Nock
- CCCG
- 2006

In this paper, we present a generalization of the smallest enclosing disk problem for point sets lying in Information-geometricâ€¦Â (More)

Is this relevant?

2005

2005

- Frank Nielsen, Richard Nock
- Inf. Process. Lett.
- 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)

Is this relevant?

2001

2001

- Pankaj K. Agarwal, Sariel Har-Peled
- SODA
- 2001

We present approximation algorithms for maintaining various descriptors of the extent of moving points in R<sup><i>d</i></supâ€¦Â (More)

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

- Pankaj K. Agarwal, Micha Sharir, Emo Welzl
- Symposium on Computational Geometry
- 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)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Micha Sharir
- Symposium on Computational Geometry
- 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)

Is this relevant?

Highly Cited

1991

Highly Cited

1991

- Emo Welzl
- 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?