Search for shortest path around semialgebraic obstacles in the plane

DOI10.1007/BF02112433zbMATH Open0835.14023MaRDI QIDQ1190959FDOQ1190959

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

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

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

Cited In (3)

• Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon
• Title not available (Why is that?)
• Title not available (Why is that?)

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)