Shortest path on a non-convex polyhedron

MaRDI QIDQ1433539zbMATH OpenFDO

Authors Mohamed H. El-Zahar, Yasser M. Abd El-Latif

Publication date 18 June 2004

Published in Journal of the Egyptian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

nonconvex polyhedronshortest path

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Review text

The authors present an algorithm to solve the shortest-path problem between two points \(A\) and \(B\) on a non-convex polyhedron in the 3-dimensional space. The algorithm constructs first all possible edge-sequences and optimizes their order. Then the points on each of the obtained edge-sequences are computed which determine the path between \(A\) and \(B\) using this edge-sequence. No detailed complexity analysis is provided.

Recommendations

• scientific article; zbMATH DE number 1225263
• scientific article; zbMATH DE number 3907791
• Approximating shortest paths on a nonconvex polyhedron
• Constructing a minimum path on a polyhedral surface in R^3
• SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS

Cited in

(5)

• Characterizing the shortest path of an object among obstacles
• A simple algorithm for building the 3-D convex hull
• Approximating shortest paths on a nonconvex polyhedron
• scientific article; zbMATH DE number 1225263 (Why is no real title available?)
• ON RECONSTRUCTING POLYHEDRA FROM PARALLEL SLICES

This page was built for publication: Shortest path on a non-convex polyhedron

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