Simple algorithms for searching a polygon with flashlights (Q1847385): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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: Q4952719 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: THE TWO GUARDS PROBLEM / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An algorithm for searching a polygonal region with a flashlight / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Searching for a Mobile Intruder in a Polygonal Region / rank | |||
Normal rank |
Revision as of 17:49, 4 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simple algorithms for searching a polygon with flashlights |
scientific article |
Statements
Simple algorithms for searching a polygon with flashlights (English)
0 references
24 June 2003
0 references
mobile guard
0 references
0 references
0 references