Bushiness and a tight worst-case upper bound on the search number of a simple polygon

Ichiro Suzuki, Masafumi Yamashita, Hideki Umemoto, Tsunehiko Kameda

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


We show that 1 + [log3(2b + 1)] is a tight worst-case upper bound on the minimum number of searchers having 360° visibility needed to search a simple polygon with bushiness b.

Original languageEnglish
Pages (from-to)49-52
Number of pages4
JournalInformation Processing Letters
Issue number1
Publication statusPublished - Apr 15 1998

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this