Sciweavers

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

76

Voted

SODA
2001
ACM

94views Algorithms» more SODA 2001»

A simple entropy-based algorithm for planar point location

15 years 4 months ago

A simple entropy-based algorithm for planar point location

Download www.cs.umd.edu

Sunil Arya, Theocharis Malamatos, David M. Mount

Real-time Traffic

Algorithms | SODA 2001 |

claim paper

Related Content

» Efficient ExpectedCase Algorithms for Planar Point Location

» Planar Point Location for Large Data Sets To Seek or Not to Seek

» Distributionsensitive point location in convex subdivisions

» FixedLocation CircularArc Drawing of Planar Graphs

» Online point location in planar arrangements and its applications

» Methods for Achieving Fast Query Times in Point Location Data Structures

» Entropypreserving cuttings and spaceefficient planar point location

» Combinatorial Roadmaps in Configuration Spaces of Simple Planar Polygons

» Improved Approximation Bounds for Planar Point Pattern Matching

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	SODA
Authors	Sunil Arya, Theocharis Malamatos, David M. Mount

Comments (0)