Hide-and-Seek: Algorithms for Polygon Walk Problems (Q3010428): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4945501 / 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 REGION FROM THE BOUNDARY / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing connected components of line segments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable / rank
 
Normal rank

Latest revision as of 06:46, 4 July 2024

scientific article
Language Label Description Also known as
English
Hide-and-Seek: Algorithms for Polygon Walk Problems
scientific article

    Statements