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.4.0.tar.gz
(29.0 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-1.4.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | 4ae56c806bf30976bf87c3e608879627e083b08a53c5c1be5275e46eab1051d5 |
|
MD5 | f374334c0fb1904196c8ab7c3a187429 |
|
BLAKE2b-256 | 50142d0c950a35545ab1d0f4849d1cd934c4263fcee5ca975c595b7cf9efff87 |
Close
Hashes for extremitypathfinder-1.4.0-py37.py38-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 08a0febb7f11de74fea1212c6c3f104d335845c88fc76953df742b7e3be5bf0c |
|
MD5 | 8a5edb064ca80dfe7553970deccbb7b2 |
|
BLAKE2b-256 | 51d5d94eade86a16b633ea5accb0b35fdfa6e4800ec93a429406081d68cb4f28 |