Pages that link to "Item:Q1188285"
From MaRDI portal
The following pages link to Watchman routes under limited visibility (Q1188285):
Displayed 13 items.
- Optimality and competitiveness of exploring polygons by mobile robots (Q617716) (← links)
- An optimal algorithm for finding the edge visibility polygon under limited visibility (Q673918) (← links)
- Performance bounds for planning in unknown terrain (Q814477) (← links)
- Finding shortest safari routes in simple polygons (Q1014417) (← links)
- Approximation algorithms for the Geometric Covering Salesman Problem (Q1343140) (← links)
- Optimally computing a shortest weakly visible line segment inside a simple polygon (Q1614066) (← links)
- Approximation algorithms for lawn mowing and milling (Q1841242) (← links)
- Competitive on-line coverage of grid environments by a mobile robot (Q1869751) (← links)
- \(\alpha\)-kernel problem with fuzzy visibility (Q1920271) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- GUARD PLACEMENT FOR MAXIMIZING <font>L</font>-VISIBILITY EXTERIOR TO A CONVEX POLYGON (Q3401891) (← links)