Pages that link to "Item:Q2390305"
From MaRDI portal
The following pages link to Shortest paths in simple polygons with polygon-meet constraints (Q2390305):
Displaying 7 items.
- Finding a shortest Hamiltonian path inside a simple polygon (Q671605) (← links)
- Query-point visibility constrained shortest paths in simple polygons (Q2465622) (← links)
- The shortest path in a simple polygon with obstacles (Q2850358) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- How to Keep an Eye on Small Things (Q5012868) (← links)
- Approximate Shortest Paths in Polygons with Violations (Q5149572) (← links)
- Shortest Path in a Polygon using Sublinear Space. (Q5368680) (← links)