𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Optimal Expected-Case Planar Point Location

✍ Scribed by Arya, Sunil; Malamatos, Theocharis; Mount, David M.; Wong, Ka Chun

Book ID
118181348
Publisher
Society for Industrial and Applied Mathematics
Year
2007
Tongue
English
Weight
293 KB
Volume
37
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Exact Worst Case Query Complexity
On the Exact Worst Case Query Complexity of Planar Point Location
✍ Raimund Seidel; Udo Adamy πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 241 KB

What is the smallest constant c so that the planar point location queries can be Ž . Ž . answered in c log n q o log n steps i.e., point᎐line comparisons in the worst 2 Ž case? M. T. Goodrich, M. Orletsky, and K. Ramaiyer 1997, in ''Proc 8th ACM-Ž . . SIAM Symp on Discrete Algorithms SODA ,'' pp. 75