Sciweavers

4 search results - page 1 / 1
» A Lower Bound on the Area of a 3-Coloured Disc Packing
Sort
View
75
Voted
CCCG
2007
15 years 1 months ago
A Lower Bound on the Area of a 3-Coloured Disc Packing
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
Peter Brass, Ferran Hurtado, Benjamin J. Lafrenier...
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
14 years 11 months ago
On Minimum-Area Hulls
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...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
AIPS
2004
15 years 1 months ago
Optimal Rectangle Packing: New Results
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...
Richard E. Korf
73
Voted
TIP
2010
155views more  TIP 2010»
14 years 10 months ago
Is Denoising Dead?
—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...
Priyam Chatterjee, Peyman Milanfar