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 journalArticle

17 Citations (Scopus)

Abstract

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
Volume66
Issue number1
Publication statusPublished - Apr 15 1998

Fingerprint

Simple Polygon
Visibility
Upper bound

All Science Journal Classification (ASJC) codes

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

Cite this

Suzuki, I., Yamashita, M., Umemoto, H., & Kameda, T. (1998). Bushiness and a tight worst-case upper bound on the search number of a simple polygon. Information Processing Letters, 66(1), 49-52.

Bushiness and a tight worst-case upper bound on the search number of a simple polygon. / Suzuki, Ichiro; Yamashita, Masafumi; Umemoto, Hideki; Kameda, Tsunehiko.

In: Information Processing Letters, Vol. 66, No. 1, 15.04.1998, p. 49-52.

Research output: Contribution to journalArticle

Suzuki, I, Yamashita, M, Umemoto, H & Kameda, T 1998, 'Bushiness and a tight worst-case upper bound on the search number of a simple polygon', Information Processing Letters, vol. 66, no. 1, pp. 49-52.
Suzuki, Ichiro ; Yamashita, Masafumi ; Umemoto, Hideki ; Kameda, Tsunehiko. / Bushiness and a tight worst-case upper bound on the search number of a simple polygon. In: Information Processing Letters. 1998 ; Vol. 66, No. 1. pp. 49-52.
@article{c23683b4866e480c9c77f25104fa0b23,
title = "Bushiness and a tight worst-case upper bound on the search number of a simple polygon",
abstract = "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.",
author = "Ichiro Suzuki and Masafumi Yamashita and Hideki Umemoto and Tsunehiko Kameda",
year = "1998",
month = "4",
day = "15",
language = "English",
volume = "66",
pages = "49--52",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "1",

}

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

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

M3 - Article

AN - SCOPUS:0012608390

VL - 66

SP - 49

EP - 52

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 1

ER -