91 search results - page 3 / 19 » On random points in the unit disk |
STACS
2010
Springer
14 years 4 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
SODA
1997
ACM
13 years 11 months ago
1997
ACM
Improving on a recent breakthrough of Sharir, we find two minimum-radius circular disks covering a planar point set, in randomized expected time O(n log2 n).
SODA
2010
ACM
14 years 7 months ago
2010
ACM
Let be a disk of radius R in the plane. A set F of closed unit disks contained in forms a maximal packing if the unit disks are pairwise disjoint and the set is maximal: i.e., i...
SIROCCO
2007
13 years 11 months ago
2007
The focus of the present paper is on providing a local deterministic algorithm for colouring the edges of Yao-like subgraphs of Unit Disc Graphs. These are geometric graphs such t...
SAC
1998
ACM
14 years 2 months ago
1998
ACM
In a Video-on-Demand server, requests from different clients are independent of each other and may arrive at random time. Commercial systems may contain hundreds to thousands of c...