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.
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-1.5.0.tar.gz
(29.4 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-1.5.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | da20470c49519f2deccaabe51a19995e4916832bfbe25be7a1df7d266d5f3048 |
|
MD5 | 29489554bc26ebec2d747ef893cbc009 |
|
BLAKE2b-256 | c993363e1e97b364c9aad9e246fe063f41271e4242f29ef2044076c503a5a4c7 |
Close
Hashes for extremitypathfinder-1.5.0-py37.py38-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 4b0b5d0c973d19b40691f98b8f216d7cd61bc930b3b77a4ae21ec39b69a50845 |
|
MD5 | 3f3074c34f9e63a13b9aca188284f649 |
|
BLAKE2b-256 | 719f75aeb72a7e4ece78670907d201dee2493b56b85dbe7894fdcf0f2ba5a856 |