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
32
click to vote
FOCS
2006
IEEE
favorite
Email
discuss
report
99
views
Theoretical Computer Science
»
more
FOCS 2006
»
Planar Point Location in Sublogarithmic Time
14 years 5 months ago
Download
people.csail.mit.edu
Mihai Patrascu
Real-time Traffic
FOCS 2006
|
Theoretical Computer Science
|
claim paper
Related Content
»
Entropypreserving cuttings and spaceefficient planar point location
»
Distributionsensitive point location in convex subdivisions
»
Nearly Optimal ExpectedCase Planar Point Location
»
Lower bounds for expectedcase planar point location
»
Efficient ExpectedCase Algorithms for Planar Point Location
»
Methods for Achieving Fast Query Times in Point Location Data Structures
»
Succinct Geometric Indexes Supporting Point Location Queries
»
Dynamic Trees and Dynamic Point Location
»
FixedLocation CircularArc Drawing of Planar Graphs
more »
Post Info
More Details (n/a)
Added
11 Jun 2010
Updated
11 Jun 2010
Type
Conference
Year
2006
Where
FOCS
Authors
Mihai Patrascu
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision