On optimal route planning evading cubes in the three space

MaRDI QIDQ1591716zbMATH OpenFDO

Authors A. Bezdek

Publication date 9 January 2001

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/227379, http://www.emis.de/journals/BAG/vol.40/no.1/6.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

shortest pathsnavigationobstaclesroute planning

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (3) dimensions (including convex surfaces) (52A15)

Recommendations

• scientific article; zbMATH DE number 4064475
• An algorithm for shortest-path motion in three dimensions
• An Efficient Algorithm for Shortest Path in Three Dimensions With Polyhedral Obstacles
• New results on shortest paths in three dimensions
• A single-exponential upper bound for finding shortest paths in three dimensions

Cited in

(3)

• Shortest path avoiding balls
• Shortest paths on cubes
• Short chains in circle and in square coverings

This page was built for publication: On optimal route planning evading cubes in the three space

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