Search for shortest path around semialgebraic obstacles in the plane

DOI10.1007/BF02112433zbMath0835.14023MaRDI QIDQ1190959

Pablo Solernó, A. O. Slisenko, Teresa Krick, Joos Heintz

Publication date: 27 September 1992

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

zbMATH Keywords

constructing the shortest pathpath in weighted graphsemi-algebraic obstacles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects of algebraic curves (14Q05) Semialgebraic sets and related spaces (14P10)

Related Items (1)

Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon

Cites Work

• Unnamed Item
• Unnamed Item
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• An algorithm for shortest-path motion in three dimensions
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• On Shortest Paths Amidst Convex Polyhedra

This page was built for publication: Search for shortest path around semialgebraic obstacles in the plane