no code implementations • 21 Aug 2024 • Jinchun Du, Bojie Shen, Muhammad Aamir Cheema
The Euclidean Shortest Path Problem (ESPP), which involves finding the shortest path in a Euclidean plane with polygonal obstacles, is a classic problem with numerous real-world applications.
