349 search results - page 20 / 70 » Covering a Set of Points with a Minimum Number of Lines |
CORR
2008
Springer
13 years 8 months ago
2008
Springer
A Steiner star for a set P of n points in Rd connects an arbitrary center point to all points of P, while a star connects a point p P to the remaining n-1 points of P. All connec...
SECON
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
FAW
2007
Springer
14 years 2 months ago
2007
Springer
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be ...
GLOBECOM
2007
IEEE
14 years 2 months ago
2007
IEEE
—Network lifetime is a critical issue in Wireless Sensor Networks. It is possible to extend network lifetime by organizing the sensors into a number of sensor covers. However, wi...
IPL
2002
13 years 7 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...