Euclidean Shortest Paths

DOI10.1007/978-1-4471-2256-2zbMath1263.68008DBLPbooks/daglib/0028155OpenAlexW4252795229WikidataQ29011232 ScholiaQ29011232MaRDI QIDQ3093762

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

shortest pathwatchman routeobstacle-avoidancepaths in cube-curvespaths in polygonspaths on surfacespolygon tourrubberband algorithmsafari problemzookeeper problem

Mathematics Subject Classification ID

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

Related Items (16)

A polygonal approximation for general 4-contours corresponding to weakly simple curves ⋮ Touring a sequence of disjoint polygons: complexity and extension ⋮ Models and algorithms for network reduction ⋮ The Power Laws of Geodesics in Some Random Sets with Dilute Concentration of Inclusions ⋮ 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 ⋮ Geometric path problems with violations ⋮ A linear time combinatorial algorithm to compute the relative orthogonal convex hull of digital objects ⋮ Computing approximately shortest descending paths on convex terrains via multiple shooting ⋮ Pasting gauges. I: Shortest paths across a hyperplane ⋮ Finding Shortest Paths in a Sequence of Triangles in 3D by the Planar Unfolding ⋮ Approximate Shortest Paths in Polygons with Violations ⋮ Finding shortest paths in a sequence of triangles in 3D by the method of orienting curves ⋮ Multiple shooting approach for computing approximately shortest paths on convex polytopes ⋮ A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints

This page was built for publication: Euclidean Shortest Paths