Pages that link to "Item:Q1082820"

The following pages link to An algorithm for shortest-path motion in three dimensions (Q1082820):

Displaying 32 items.

• Multiple shooting approach for computing approximately shortest paths on convex polytopes (Q507990) (← links)
• Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon (Q598213) (← links)
• Towards exact geometric computation (Q676577) (← links)
• Continuous alternation: the complexity of pursuit in continuous domains (Q686740) (← links)
• Shortest paths without a map (Q809612) (← links)
• On maximum flows in polyhedral domains (Q918212) (← links)
• Approximation algorithms for shortest descending paths in terrains (Q972363) (← links)
• Shortest paths in the plane with convex polygonal obstacles (Q1085615) (← links)
• Optimal piecewise linear motion of an object among obstacles (Q1098643) (← 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)
• Search for shortest path around semialgebraic obstacles in the plane (Q1190959) (← links)
• The application of \(\psi\)-transform for determining a near-optimal path in the presence of polyhedral obstacles (Q1195949) (← links)
• Approximate kinodynamic planning using \(L_ 2\)-norm dynamic bounds (Q1324341) (← links)
• Practical methods for approximating shortest paths on a convex polytope in \(\mathbb{R}^3\) (Q1388131) (← links)
• Three-dimensional Euclidean distance transformation and its application to shortest path planning (Q1886624) (← links)
• An efficient approach to 3D path planning (Q2004715) (← links)
• The shortest path AMID 3-D polyhedral obstacles (Q2073355) (← links)
• Flying over a polyhedral terrain (Q2380051) (← links)
• An approximation algorithm for computing shortest paths in weighted 3-d domains (Q2391841) (← links)
• EXACT AND APPROXIMATION ALGORITHMS FOR FINDING AN OPTIMAL BRIDGE CONNECTING TWO SIMPLE POLYGONS (Q3373057) (← links)
• ENERGY-AWARE STAGE ILLUMINATION (Q3521594) (← links)
• GENERALIZED WATCHMAN ROUTE PROBLEM WITH DISCRETE VIEW COST (Q3562851) (← links)
• Visibility graphs and obstacle-avoiding shortest paths (Q3803163) (← links)
• Constructing Approximate Shortest Path Maps in Three Dimensions (Q4268702) (← links)
• (Q4961273) (← links)
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces (Q5054837) (← links)
• A Near-Optimal Algorithm for Shortest Paths Among Curved Obstacles in the Plane (Q5097508) (← links)
• A Model for Optimal Human Navigation with Stochastic Effects (Q5117979) (← links)
• Navigating Weighted Regions with Scattered Skinny Tetrahedra (Q5370569) (← links)
• Time-minimal paths amidst moving obstacles in three dimensions (Q5958315) (← links)