scientific article; zbMATH DE number 4216992

MaRDI QIDQ3362376zbMATH OpenFDO

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

Publication date 1991

Full work available at URL https://eudml.org/doc/68185

zbMATH Keywords

constructing the shortest pathpath in weighted graphsemi-algebraic obstacles

Mathematics Subject Classification ID

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

Recommendations

• Search for shortest path around semialgebraic obstacles in the plane
• Shortest paths in the plane with convex polygonal obstacles
• Shortest paths in the plane with polygonal obstacles
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• A near-optimal algorithm for shortest paths among curved obstacles in the plane
• Shortest paths in the plane with obstacle violations
• Shortest paths in the plane with obstacle violations
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE
• Computing shortest paths among curved obstacles in the plane
• Computing shortest paths among curved obstacles in the plane

Cited in

(6)

• Lower bounds for diophantine approximations
• Finding the shortest path by evolving junctions on obstacle boundaries (E-JOB): an initial value ODE's approach
• scientific article; zbMATH DE number 17838 (Why is no real title available?)
• scientific article; zbMATH DE number 1262422 (Why is no real title available?)
• Shortest path amidst disc obstacles is computable
• Approximating shortest path for the skew lines problem in time doubly logarithmic in 1/epsilon

This page was built for publication:

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