Simple algorithms for searching a polygon with flashlights (Q1847385): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00235-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059654325 / rank
 
Normal rank

Latest revision as of 10:22, 30 July 2024

scientific article
Language Label Description Also known as
English
Simple algorithms for searching a polygon with flashlights
scientific article

    Statements