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.3.0.tar.gz
(28.9 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-1.3.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | f5f15b9d8b2c33c4a256f9423a447649021d7941e6689054f1685ca4da3aa230 |
|
MD5 | 209fb41bc26455b7728f7552605a7d4e |
|
BLAKE2b-256 | 42dfdd474386f7e825e147a1d422a01c39d3549a6b5a336ee1c85883c888765c |
Close
Hashes for extremitypathfinder-1.3.0-py37.py38-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 66b52a0200b7d94169e60c8d0515dc009d7dfeabbe78c18ff3f8c07a0be13501 |
|
MD5 | c9be9b7b292102d260544438c6f4a33d |
|
BLAKE2b-256 | 80f0359aaaf3c983838537758e3ca43cf0a8bf7fcf0bfe584e400ad25fad062e |