BUSHINESS AND A TIGHT WORST-CASE UPPER BOUND ON THE SEARCH NUMBER OF A SIMPLE POLYGON

Authors
SUZUKI I YAMASHITA M UMEMOTO H KAMEDA T
Citation
I. Suzuki et al., BUSHINESS AND A TIGHT WORST-CASE UPPER BOUND ON THE SEARCH NUMBER OF A SIMPLE POLYGON, Information processing letters, 66(1), 1998, pp. 49-52
Citations number
6
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
66
Issue
1
Year of publication
1998
Pages
49 - 52
Database
ISI
SICI code
0020-0190(1998)66:1<49:BAATWU>2.0.ZU;2-N
Abstract
We show that 1 + [log(3)(2b + 1)] is a tight worst-case upper bound on the minimum number of searchers having 360 degrees visibility needed to search a simple polygon with bushiness b. (C) 1998 Elsevier Science B.V.