An Experimental Study of Weighted k-Link Shortest Path Algorithms

DOI10.1007/978-3-540-68405-3_12zbMath1188.93059OpenAlexW2150591286MaRDI QIDQ3564306

Joseph S. B. Mitchell, Ovidiu Daescu, James Dean Palmer, Chee-Keng Yap, Simeon C. Ntafos

Publication date: 2 June 2010

Published in: Springer Tracts in Advanced Robotics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68405-3_12

zbMATH Keywords

performance studyminimum-weight polygonal pathweighted polygonal subdivision

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Geometric methods (93B27) Automated systems (robots, etc.) in control theory (93C85)

Related Items (1)

Path refinement in weighted regions

Uses Software

• BUSHWHACK

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing optimal beams in two and three dimensions
• Approximation algorithms for geometric shortest path problems
• Determining approximate shortest paths on weighted polyhedral surfaces
• The weighted region problem
• An ε — Approximation algorithm for weighted shortest paths on polyhedral surfaces
• Algorithms and Data Structures
• Fundamentals of Computation Theory
• Determining an optimal penetration among weighted regions in two and three dimensions
• Approximating shortest paths on weighted polyhedral surfaces

This page was built for publication: An Experimental Study of Weighted k-Link Shortest Path Algorithms