python package for fast shortest path computation on 2D polygon or grid maps
Project description
python package for fast geometric shortest path computation in 2D multi-polygon or grid environments based on visibility graphs.
Quick Guide:
Install the package with the optional Numba extra for a significant speedup:
pip install extremitypathfinder[numba]
from extremitypathfinder import PolygonEnvironment
environment = PolygonEnvironment()
# counter clockwise vertex numbering!
boundary_coordinates = [(0.0, 0.0), (10.0, 0.0), (9.0, 5.0), (10.0, 10.0), (0.0, 10.0)]
# clockwise numbering!
list_of_holes = [
[
(3.0, 7.0),
(5.0, 9.0),
(4.5, 7.0),
(5.0, 4.0),
],
]
environment.store(boundary_coordinates, list_of_holes, validate=False)
start_coordinates = (4.5, 1.0)
goal_coordinates = (4.0, 8.5)
path, length = environment.find_shortest_path(start_coordinates, goal_coordinates)
For more refer to the documentation.
Project details
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
extremitypathfinder-2.7.0.tar.gz
(39.5 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-2.7.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | ec5f4e622443eed9d401d2371b4b9f3e8f349a3db4aee7e50ac227a96ec7506a |
|
MD5 | 50df5a79bc7ba3e4c90a1c3fe06b3147 |
|
BLAKE2b-256 | 0862f449741a21edfe0b304a9854e017b90eee8ad7c0f0254b3e5b1ce851235c |
Close
Hashes for extremitypathfinder-2.7.0-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | eb1a3de2e61f869948f1c3265a1e92b93e84ab98b3edb46d7dd8041d037bfe7d |
|
MD5 | 7e4d83762a5d32dd391aaf62b7e86fe3 |
|
BLAKE2b-256 | 52f0f2db351050f5a4633fa2ab1d1609da112506c69342d4cab5419eedb696d7 |