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.1.tar.gz
(39.9 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-2.7.1.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 9002ebeb14459a82e82bc6198f44d290031d2737a14b43b9a8efd9378be743c0 |
|
MD5 | f8035a3f5bbfffc015b773ffc8243c6f |
|
BLAKE2b-256 | bba68ca91f526c0ed19c53761564b4fad1b88b8dc3c86424a17ef88b95f05aa0 |
Close
Hashes for extremitypathfinder-2.7.1-py3-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 8acbf59b5ac26cd0efd2e8fd3ed7b917cb394d3b5ffeefcd6b638baa6764e0bf |
|
MD5 | 75650b54f3478dcc718c0776526ecb62 |
|
BLAKE2b-256 | aa52b1c02f0a2907568ea9b5769bf1662d70f5d77c499c324764b97bf7b54dce |