Approximate Euclidean shortest paths amid convex obstacles

MaRDI QIDQ4633835zbMATH OpenFDO

Authors R. Sharathkumar, Hai Yu, Pankaj K. Agarwal

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496802

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Analysis of algorithms (68W40)

Recommendations

• scientific article; zbMATH DE number 910885
• Approximating shortest paths on a convex polytope in three dimensions
• Shortest paths in the plane with convex polygonal obstacles
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• scientific article; zbMATH DE number 1305410

Cited in

(13)

• An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane
• Three-dimensional Euclidean distance transformation and its application to shortest path planning
• Computing an \(L_1\) shortest path among splinegonal obstacles in the plane
• Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
• An approximation algorithm for computing shortest paths in weighted 3-d domains
• On the minimum eccentricity shortest path problem
• A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
• SHORTEST RECTILINEAR PATHS AMONG WEIGHTED OBSTACLE
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• scientific article; zbMATH DE number 7151640 (Why is no real title available?)
• The Length of Shortest Vertex Paths in Binary Occupancy Grids Compared to Shortest r-Constrained Ones
• Optimal motion planning for two square robots in a rectilinear environment
• Routing among convex polygonal obstacles in the plane using a simplified domain

This page was built for publication: Approximate Euclidean shortest paths amid convex obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633835)