Shortest paths in the plane with convex polygonal obstacles

DOI10.1016/0020-0190(86)90045-1zbMath0607.68052OpenAlexW2016584965MaRDI QIDQ1085615

Hans Rohnert

Publication date: 1986

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(86)90045-1

zbMATH Keywords

computational geometryconvex polygonal obstacles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Related Items

k-th shortest collision-free path planning, Visibility between two edges of a simple polygon, Time and space efficient algorithms for shortest paths between convex polygons, The maximin line problem with regional demand, Minimal tangent visibility graphs, Shortest paths in the plane with obstacle violations, Computing \(L_1\) shortest paths among polygonal obstacles in the plane, Visibility graphs and obstacle-avoiding shortest paths, Linear approximation of simple objects, Approximate Shortest Paths in Polygons with Violations, Computing the visibility polygon of an island in a polygonal domain, An exact geometry-based algorithm for path planning, Unnamed Item, An efficient algorithm for facility location in the presence of forbidden regions, Computing an \(L_1\) shortest path among splinegonal obstacles in the plane

Cites Work

• Unnamed Item
• An algorithm for shortest-path motion in three dimensions
• Computing the extreme distances between two convex polygons