Back to Results
First PageMeta Content
Point location / Statistical theory / Randomized algorithm / Trapezoid / Computational geometry / Algorithm / Entropy / Trapezoid graph / Mathematics / Applied mathematics / Theoretical computer science


A Simple Entropy-Based Algorithm for Planar Point Location∗ Sunil Arya† Theocharis Malamatos‡ David M. Mount§
Add to Reading List

Document Date: 2007-02-02 02:49:19


Open Document

File Size: 212,44 KB

Share Result on Facebook

City

Kowloon / /

Country

Germany / China / /

Currency

pence / /

/

Facility

Hong Kong University of Science / College Park / University of Maryland / /

IndustryTerm

worst-case efficient algorithm / expected search / actual algorithm / incremental algorithm / randomized incremental algorithm / search path / average search times / point location algorithm / average-case search time / average search time / construction algorithm / point-location algorithms / randomized incremental construction algorithm / binary search tree / search structure / /

Organization

National Science Foundation / Department of Computer Science / Institute for Advanced Computer Studies / Max Plank Institut f¨ / Hong Kong University of Science and Technology / Research Grants Council / University of Maryland / College Park / /

Person

John Iacono / David M. Mount / Max Plank / Sunil Arya / /

Position

author / /

ProvinceOrState

Maryland / /

Technology

point-location algorithms / randomized incremental construction algorithm / randomized algorithm / point location algorithm / 2 Weighted Randomized Incremental Algorithm / randomized incremental algorithm / construction algorithm / incremental algorithm / actual algorithm / /

SocialTag