python package for geometric shortest path computation for given 2D multi-polygon maps
Project description
python package for fast geometric shortest path computation in 2D multi-polygon or grid environments based on visibility graphs.Please 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.1.0.tar.gz
(30.4 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-2.1.0.tar.gz
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 5cfc48baac59cbff5d438eb92264b3fe6d070ad7359f426f3da37903af118731 |
|
| MD5 | ef92092ba258ebfaaaff6c7b0b156109 |
|
| BLAKE2b-256 | 3b79863c3b08da8131909b82a226a98eff85fcea04239007b214c2fb5f3df602 |
Close
Hashes for extremitypathfinder-2.1.0-py37.py38-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 6671e54a9fdf069ffe9ef67a47d078b376884c8676c7bb3de804614afb42a6b7 |
|
| MD5 | 97784c32b64ba5cc1e67332dfbcdea95 |
|
| BLAKE2b-256 | 66701f3a8fa3a1d294fa4ddf01f533750ef635991227315d24ea2c87e9a26965 |
