Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

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

Highly Cited

2013

Highly Cited

2013

Motivated by recent developments in Wireless Sensor Networks (WSNs), we present several efficient clustering algorithms for… Expand

2006

2006

We present a generalization of Welzl's smallest enclosing disk algorithm [E. Welzl, Smallest enclosing disks (balls and… Expand

2003

2003

We prove that given a fixed radius r, the set of isometry-invariant probability measures supported on 'periodic' radius r-circle… Expand

2001

2001

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

We present approximation algorithms for maintaining various descriptors of the extent of moving points in Rd. We first describe a… Expand

Highly Cited

2000

Highly Cited

2000

Three methods are described for exploring a continuous unknown planar region by a group of robots having limited sensors and no… Expand

1994

1994

Abstract We present an efficient algorithm for solving the “smallest k-enclosing circle” (kSC) problem: Given a set of n points… Expand

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

Highly Cited

1991

Highly Cited

1991

A simple randomized algorithm is developed which computes the smallest enclosing disk of a finite set of points in the plane in… Expand