Euclidean shortest paths. Exact or approximate algorithms.

DOI10.1007/978-1-4471-2256-2MaRDI QIDQ3093762zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Fajie Li, Reinhard Klette

Publication date 18 October 2011

Full work available at URL https://doi.org/10.1007/978-1-4471-2256-2

zbMATH Keywords

obstacle-avoidancepaths in cube-curvespaths in polygonspaths on surfacespolygon tourrubberband algorithmsafari problemshortest pathwatchman routezookeeper problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence for robotics (68T40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Approximate Euclidean Shortest Paths in 3-Space
• An Optimal Algorithm for Euclidean Shortest Paths in the Plane
• Application of the A^* algorithm to problems of the Euclidean shortest paths in the plane with polygonal obstacles
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• Euclidean shortest paths in the presence of rectilinear barriers

Cited in

(19)

• Geometric path problems with violations
• Computing approximately shortest descending paths on convex terrains via multiple shooting
• Pasting gauges. I: Shortest paths across a hyperplane
• Fast optimal and bounded suboptimal Euclidean pathfinding
• A polygonal approximation for general 4-contours corresponding to weakly simple curves
• A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects
• A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints
• The power laws of geodesics in some random sets with dilute concentration of inclusions
• Touring a sequence of disjoint polygons: complexity and extension
• Models and algorithms for network reduction
• Approximate Euclidean Shortest Paths in 3-Space
• Finding shortest paths in a sequence of triangles in 3D by the planar unfolding
• Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves
• Precision-Sensitive Euclidean Shortest Path in 3-Space
• Multiple shooting approach for computing approximately shortest paths on convex polytopes
• Approximate Shortest Paths in Polygons with Violations
• Simplifying obstacles for Steiner network problems in the plane
• Covariate construction of nonconvex windows for spatial point patterns
• Shortest Paths in Graphs of Convex Sets

This page was built for publication: Euclidean shortest paths. Exact or approximate algorithms.

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