Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
31
click to vote
CCCG
2007
favorite
Email
discuss
report
111
views
Computational Geometry
»
more
CCCG 2007
»
A Lower Bound on the Area of a 3-Coloured Disc Packing
14 years 28 days ago
Download
www.cs.uwaterloo.ca
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
Real-time Traffic
CCCG 2007
|
Computational Geometry
|
Pairwise Disjoint Subset
|
claim paper
Post Info
More Details (n/a)
Added
29 Oct 2010
Updated
29 Oct 2010
Type
Conference
Year
2007
Where
CCCG
Authors
Peter Brass, Ferran Hurtado, Benjamin J. Lafreniere, Anna Lubiw
Comments
(0)
Researcher Info
Computational Geometry Study Group
Computer Vision