scientific article; zbMATH DE number 4064475

zbMATH Open0652.68044MaRDI QIDQ3798232FDOQ3798232

James A. Storer, J. Reif

Publication date: 1988

Title of this publication is not available (Why is that?)

Recommendations

• On Shortest Paths in Polyhedral Spaces
• On Shortest Paths Amidst Convex Polyhedra
• New results on shortest paths in three dimensions
• Shortest paths in the plane with polygonal obstacles
• SHORTEST PATHS AMONG OBSTACLES IN THE PLANE

zbMATH Keywords

Voronoi diagramEuclidean spacequadratic curvestheory of real closed fieldsminimal length pathminimal movement problemmover's problemrobotics motion planning

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Convex sets in (2) dimensions (including convex curves) (52A10) Fields related with sums of squares (formally real fields, Pythagorean fields, etc.) (12D15)

Cited In (12)

• On optimal route planning evading cubes in the three space
• Continuous alternation: the complexity of pursuit in continuous domains
• Constructing Approximate Shortest Path Maps in Three Dimensions
• Three-dimensional Euclidean distance transformation and its application to shortest path planning
• The shortest path AMID 3-D polyhedral obstacles
• Walking around fat obstacles.
• An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles
• Time-minimal paths amidst moving obstacles in three dimensions
• Parallel rectilinear shortest paths with rectangular obstacles
• On Shortest Paths Amidst Convex Polyhedra
• A single-exponential upper bound for finding shortest paths in three dimensions
• An algorithm for shortest-path motion in three dimensions

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 Q3798232)