839 search results - page 145 / 168 » Three-Clustering of Points in the Plane |
SPAA
2005
ACM
14 years 1 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
IPSN
2005
Springer
14 years 1 months ago
2005
Springer
— We propose a low overhead scheme for detecting a network partition or cut in a sensor network. Consider a network S of n sensors, modeled as points in a two-dimensional plane. ...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
SAC
2004
ACM
14 years 1 months ago
2004
ACM
Extracting object boundaries in thermal images is a challenging task because of the amorphous nature of the images and the lack of sharp boundaries. Classical edge-based segmentat...