Pages that link to "Item:Q3753528"
From MaRDI portal
The following pages link to On Shortest Paths in Polyhedral Spaces (Q3753528):
Displayed 31 items.
- Computing the external geodesic diameter of a simple polygon (Q583892) (← links)
- Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
- Algorithms for approximate shortest path queries on weighted polyhedral surfaces (Q603866) (← links)
- Towards exact geometric computation (Q676577) (← links)
- Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
- Approximate convex decomposition of polyhedra and its applications (Q735498) (← links)
- Shortest polygonal paths in space (Q756442) (← links)
- An optimal-time algorithm for shortest paths on realistic polyhedra (Q848859) (← links)
- Shortest monotone descent path problem in polyhedral terrain (Q876505) (← links)
- Star unfolding convex polyhedra via quasigeodesic loops (Q977183) (← links)
- A polynomial solution for the Potato-peeling problem (Q1076347) (← links)
- On multiple moving objects (Q1102134) (← links)
- Rectilinear shortest paths in the presence of rectangular barriers (Q1109046) (← links)
- An algorithmic approach to some problems in terrain navigation (Q1116366) (← links)
- A survey of motion planning and related geometric algorithms (Q1123032) (← links)
- \(L_ 1\) shortest paths among polygonal obstacles in the plane (Q1188116) (← links)
- Parallel rectilinear shortest paths with rectangular obstacles (Q1190293) (← links)
- The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles (Q1195949) (← links)
- Nonoverlap of the star unfolding (Q1199127) (← links)
- Computing minimum length paths of a given homotopy class (Q1330462) (← links)
- A new algorithm for shortest paths among obstacles in the plane (Q1356167) (← links)
- Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
- Optimal path planning based on visibility (Q1411497) (← links)
- Storing the subdivision of a polyhedral surface (Q1820438) (← links)
- Voronoi diagrams with barriers and on polyhedra for minimal path planning (Q1822055) (← links)
- Ununfoldable polyhedra with convex faces (Q1869740) (← links)
- An optimal-time algorithm for shortest paths on a convex polytope in three dimensions (Q2482203) (← links)
- Metric combinatorics of convex polyhedra: cut loci and nonoverlapping unfoldings (Q2482209) (← links)
- Parameter estimation for resin transfer molding (Q2777709) (← links)
- Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← links)
- Thaw: A Tool for Approximating Cut Loci on a Triangulation of a Surface (Q5471251) (← links)