https://github.com/kevinzg/spholes

2d Euclidean shortest path solver
https://github.com/kevinzg/spholes

computational-geometry shortest-paths visibility visibility-graph

Last synced: 2 months ago
JSON representation

2d Euclidean shortest path solver

• Host: GitHub
• URL: https://github.com/kevinzg/spholes
• Owner: kevinzg
• License: mit
• Created: 2017-10-20T23:55:10.000Z (almost 8 years ago)
• Default Branch: master
• Last Pushed: 2019-03-14T21:11:40.000Z (over 6 years ago)
• Last Synced: 2025-04-02T22:33:08.422Z (6 months ago)
• Topics: computational-geometry, shortest-paths, visibility, visibility-graph
• Language: C++
• Homepage:
• Size: 348 KB
• Stars: 4
• Watchers: 1
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
# spholes

This is a 2d [Euclidean shortest path](https://en.wikipedia.org/wiki/Euclidean_shortest_path) solver with a Qt interface.

![screenshot](./docs/screenshot.png)

The algorithm source code is in the `src/spholes` directory. It is based on the $O(n^2 \log n)$ visibility graph algorithm found on the chapter 15 of [Computational Geometry Algorithms and Applications](https://www.springer.com/us/book/9783540779735) book by de Berg, et al, and Dijkstra's algorithm.

To use it just set the start and destination points, add obstacles clockwise and click solve.