Pages that link to "Item:Q1014417"
From MaRDI portal
The following pages link to Finding shortest safari routes in simple polygons (Q1014417):
Displaying 9 items.
- On finding a shortest isothetic path and its monotonicity inside a digital object (Q499711) (← links)
- A 2-approximation algorithm for the zookeeper's problem (Q845863) (← links)
- Optimal placement of base stations in border surveillance using limited capacity drones (Q2079881) (← links)
- Shortest paths in simple polygons with polygon-meet constraints (Q2390305) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints (Q2811488) (← links)
- Efficient Algorithms for Touring a Sequence of Convex Polygons and Related Problems (Q2988854) (← links)
- EXISTENCE AND COMPUTATION OF TOURS THROUGH IMPRECISE POINTS (Q3007721) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
