Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

86

Voted

FOCS
2006
IEEE

99views Theoretical Computer Science» more FOCS 2006»

Planar Point Location in Sublogarithmic Time

15 years 8 months ago

Planar Point Location in Sublogarithmic Time

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

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)