TY - JOUR
T1 - Bushiness and a tight worst-case upper bound on the search number of a simple polygon
AU - Suzuki, Ichiro
AU - Yamashita, Masafumi
AU - Umemoto, Hideki
AU - Kameda, Tsunehiko
N1 - Funding Information:
Thih work was supported in palt by a Scientific Resexch Grant-in-Aid from the Ministry of Education, Science and Culture of Japan under Grant 07243219 and 07680360. the National Science Foundation under Grant IRI-9307506. the Office of Naval Research under Grant NOOO14-94-I-0284, the Natural Sciences and Engineering Council of Canada. and an endowed chair supported by Hitachi Ltd. at Faculty of Engineering Science, Osaka University. * Corresponding author. Email: suzuki@blatz.cs.uwm.cdu. ’ Email: mak~)se.hirohhilma-u.ac.jp. ’ Email: umemoto@accpd3.anrit~u.co.jp. ’ Email: tiko@cs.cfu.ca.
PY - 1998/4/15
Y1 - 1998/4/15
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0012608390&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0012608390&partnerID=8YFLogxK
U2 - 10.1016/s0020-0190(98)00029-5
DO - 10.1016/s0020-0190(98)00029-5
M3 - Article
AN - SCOPUS:0012608390
SN - 0020-0190
VL - 66
SP - 49
EP - 52
JO - Information Processing Letters
JF - Information Processing Letters
IS - 1
ER -