14 search results - page 2 / 3 » Covering point sets with two disjoint disks or squares |
JCO
2006
13 years 6 months ago
2006
In this paper, we present a combinatorial theorem on labeling disjoint axis-parallel squares of edge length two using points. Given an arbitrary set of disjoint axis-parallel squar...
CCCG
2008
13 years 7 months ago
2008
Let P be the point set in two dimensional plane. In this paper, we consider the problem of locating two isothetic unit squares such that together they cover maximum number of poin...
SODA
1997
ACM
13 years 7 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).
WADS
2007
Springer
14 years 13 days ago
2007
Springer
We present new asymptotically tight bounds on cuttings, a fundamental data structure in computational geometry. For n objects in space and a parameter r ∈ N, an 1 r -cutting is ...
APAL
2004
13 years 6 months ago
2004
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...