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.
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.2.tar.gz
(40.3 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-2.7.2.tar.gz
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 903498578db6dfaca3e7cbe8279f2e13baa2043660084fb4455f6588af4d93f1 |
|
| MD5 | 9e9bf8c3be23307cb911672ed2a41b29 |
|
| BLAKE2b-256 | 5c5a8692b0a56aca8f51fb5d839d2607ff71b95fd6ba6540784666e09668ac4f |
Close
Hashes for extremitypathfinder-2.7.2-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | e17d6a3f29d54b240825450e3dac2fc332bfdff62c8247bcddcc007fa38f7151 |
|
| MD5 | 26cfe6329371610154e2ddc41b3d18e6 |
|
| BLAKE2b-256 | 27bd426d797f117e6df0b17045f8640ef5da232bcd1b2ba4f7e38e103b6185de |
