Search for shortest path around semialgebraic obstacles in the plane

DOI10.1007/BF02112433MaRDI QIDQ1190959zbMATHFDO

Authors A. O. Slisenko, Pablo Solernó, 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) Semialgebraic sets and related spaces (14P10) Computational aspects of algebraic curves (14Q05)

Cites work

• scientific article; zbMATH DE number 17525 (Why is no real title available?)
• scientific article; zbMATH DE number 3497890 (Why is no real title available?)
• An algorithm for shortest-path motion in three dimensions
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Constructing the visibility graph for n-line segments in \(O(n^ 2)\) time
• Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons
• On Shortest Paths Amidst Convex Polyhedra

Cited in

(3)

• scientific article; zbMATH DE number 4216992 (Why is no real title available?)
• Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
• scientific article; zbMATH DE number 17838 (Why is no real title available?)

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

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