Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (Q2583537): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: SEARCHING FOR A MOBILE INTRUDER IN A CORRIDOR —THE OPEN EDGE VARIANT OF THE POLYGON SEARCH PROBLEM / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The complexity of searching a graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Searching for a Mobile Intruder in a Polygonal Region / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Searching for mobile intruders in a polygonal region by a group of mobile searchers / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Revision as of 15:20, 11 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bushiness and a tight worst-case upper bound on the search number of a simple polygon. |
scientific article |
Statements
Bushiness and a tight worst-case upper bound on the search number of a simple polygon. (English)
0 references
17 January 2006
0 references
Computational geometry
0 references
Polygon search
0 references
Search number
0 references
Worst-case bound
0 references
Bushiness
0 references
0 references
