An efficient algorithm for shortest path in three dimensions with polyhedral obstacles

Keyphrases

• Shortest Path 100%
• Polyhedral 100%
• Three-dimensional Space 50%
• Iterative Methods 50%
• Number of Edges 50%
• Precise Location 50%
• Minimum Length 50%
• Computer Storage 50%
• Tridiagonal Matrix 50%

Mathematics

• Edge 100%
• Three-Dimension 100%
• Matrix 50%
• Precise Location 50%
• Path Length 50%
• Skew lines 50%
• Dimensional Space 50%
• Intersecting Line 50%

Computer Science

• Efficient Algorithm 100%
• Tridiagonal Matrix 100%
• Dimensional Space 100%
• Precise Location 100%