![]() |
Volumn 66, Issue 1, 1998, Pages 49-52
|
Bushiness and a tight worst-case upper bound on the search number of a simple polygon
|
Author keywords
Bushiness; Computational geometry; Polygon search; Search number; Worst case bound
|
Indexed keywords
|
EID: 0012608390
PISSN: 00200190
EISSN: None
Source Type: Journal
DOI: 10.1016/s0020-0190(98)00029-5 Document Type: Article |
Times cited : (17)
|
References (6)
|