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
37
click to vote
FOCS
2010
IEEE
favorite
Email
discuss
report
182
views
Theoretical Computer Science
»
more
FOCS 2010
»
A Non-linear Lower Bound for Planar Epsilon-Nets
13 years 10 months ago
Download
www.math.tau.ac.il
We show that the minimum possible size of an -net for point objects and line (or rectangle)ranges in the plane is (slightly) bigger than linear in 1/ . This settles a problem raised by Matousek, Seidel and Welzl in 1990.
Noga Alon
Real-time Traffic
FOCS 2010
|
Linear
|
Minimum Possible Size
|
Point Objects
|
Theoretical Computer Science
|
claim paper
Post Info
More Details (n/a)
Added
11 Feb 2011
Updated
11 Feb 2011
Type
Journal
Year
2010
Where
FOCS
Authors
Noga Alon
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision