Login / Signup
Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon.
Ichiro Suzuki
Masafumi Yamashita
Hideki Umemoto
Tsunehiko Kameda
Published in:
Inf. Process. Lett. (1998)
Keyphrases
</>
upper bound
worst case
lower bound
running times
space complexity
search algorithm
computational complexity
approximation algorithms
constant factor
search space
average case
long range
machine learning
multiscale
coarse to fine