Distribution-sensitive point location in convex subdivisions

13 years 6 months ago

Download www.scs.carleton.ca

A data structure is presented for point location in convex planar subdivisions when the distribution of queries is known in advance. The data structure has an expected query time that is within a constant factor of optimal.

Sébastien Collette, Vida Dujmovic, John Iac

Real-time Traffic

Algorithms | Convex Planar Subdivisions | Data Structure | Point Location | SODA 2008 |

claim paper

» Nearly Optimal ExpectedCase Planar Point Location

» Efficient ExpectedCase Algorithms for Planar Point Location

» Physicsinspired topology changes for thin fluid features

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2008
Where	SODA
Authors	Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin

Comments (0)

Sciweavers

Distribution-sensitive point location in convex subdivisions

Algorithms | Convex Planar Subdivisions | Data Structure | Point Location | SODA 2008 |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers