4 search results - page 1 / 1 » A Lower Bound on the Area of a 3-Coloured Disc Packing |
CCCG
2007
13 years 6 months ago
2007
Given a set of unit-discs in the plane with union area A, what fraction of A can be covered by selecting a pairwise disjoint subset of the discs? Rado conjectured
ALGORITHMICA
1998
13 years 4 months ago
1998
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
AIPS
2004
13 years 6 months ago
2004
We present new results on the problem of finding an enclosing rectangle of minimum area that will contain a given a set of rectangles. Many simple scheduling tasks can be modelled...
TIP
2010
13 years 3 months ago
2010
—Image denoising has been a well studied problem in the field of image processing. Yet researchers continue to focus attention on it to better the current state-of-the-art. Rece...