Pages that link to "Item:Q4016400"
From MaRDI portal
The following pages link to Shortest Paths Help Solve Geometric Optimization Problems in Planar Regions (Q4016400):
Displaying 12 items.
- Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
- Finding a largest-area triangle in a terrain in near-linear time (Q832865) (← links)
- Shortest curves in planar regions with curved boundary (Q1210291) (← links)
- Visibility graphs, dismantlability, and the cops and robbers game (Q1693315) (← links)
- Computing an \(L_1\) shortest path among splinegonal obstacles in the plane (Q2082179) (← links)
- Largest triangle inside a terrain (Q2222094) (← links)
- Largest triangles in a polygon (Q2230417) (← links)
- Quickest visibility queries in polygonal domains (Q2316797) (← links)
- A tight bound for point guards in piecewise convex art galleries (Q2391541) (← links)
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest (Q5056924) (← links)
- Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) (← links)
- Voronoi-based splinegon decomposition and shortest-path tree computation (Q6563938) (← links)