- The Shortest Path with Increasing Chords in a Simple Polygon
2022/02/24 by Mart Hagedoorn, Hagedoorn, Mart, Irina Kostitsyna +1 · 1 citation
Computer Science · Engineering · Mathematics · #Combinatorics #Computational Geometry (cs.CG) #Computational Geometry and Mesh Generation #Computer network #Computer science #Constrained Shortest Path First #Data Management and Algorithms #Dijkstra's algorithm #Euclidean shortest path #FOS: Computer and information sciences #Geometry #Graph #K shortest path routing #Mathematics #Monotone polygon #Optimization and Packing Problems #Path (computing) #Polygon (computer graphics) #Shortest Path Faster Algorithm #Shortest path problem #Simple polygon #Yen's algorithm #cs.CG
- Shortest paths in the plane with convex polygonal obstacles
1986/08/01 by Hans Rohnert · 1 citation
Computer Science · Mathematics · #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex hull #Dijkstra's algorithm #Disjoint sets #Euclidean shortest path #Floyd–Warshall algorithm #Geometry #Graph #K shortest path routing #Mathematics #Optimization and Search Problems #Path (computing) #Plane (geometry) #Regular polygon #Robotic Path Planning Algorithms #Shortest Path Faster Algorithm #Shortest path problem #Yen's algorithm