Pages that link to "Item:Q4513202"
From MaRDI portal
The following pages link to Two-Guard Walkability of Simple Polygons (Q4513202):
Displaying 17 items.
- LR-visibility in polygons (Q676582) (← links)
- An efficient algorithm for the three-guard problem (Q1003478) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Partially walking a polygon (Q2331219) (← links)
- Minimization of the maximum distance between the two guards patrolling a polygonal region (Q2445875) (← links)
- Characterizing and recognizing LR-visibility polygons (Q2448917) (← links)
- A Linear-Time Algorithm for Finding All Door Locations That Make a Room Searchable (Q3502674) (← links)
- FINDING ALL DOOR LOCATIONS THAT MAKE A ROOM SEARCHABLE (Q3562853) (← links)
- CLEARING A POLYGON WITH TWO 1-SEARCHERS (Q3628102) (← links)
- SEARCHING A POLYGONAL REGION FROM THE BOUNDARY (Q4682159) (← links)
- SEARCHING A POLYGONAL ROOM WITH ONE DOOR BY A 1-SEARCHER (Q4682196) (← links)
- ON HAMILTONIAN TRIANGULATIONS IN SIMPLE POLYGONS (Q4949991) (← links)
- Finding all weakly-visible chords of a polygon in linear time (Q5056171) (← links)
- Partially Walking a Polygon (Q5091053) (← links)
- On hamiltonian triangulations in simple polygons (Extended Abstract) (Q5096949) (← links)
- Line-of-Sight Pursuit in Monotone and Scallop Polygons (Q5149564) (← links)
- Characterizing LR-visibility polygons and related problems (Q5931367) (← links)
