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 check Github for the documentation with plots: https://github.com/MrMinimal64/extremitypathfinder
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.1.0.tar.gz
(28.2 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-1.1.0.tar.gz
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 8dab4d417d47ca2fab94cb5a30377101f8562f0c418268d9208292853bbcacfc |
|
| MD5 | f8e796b058d95bc366731fb7cb0e1386 |
|
| BLAKE2b-256 | 7fe4f1ba80e8e4bbf6572043705523e796e1d516b0cf4c639505c27af0e820c0 |
Close
Hashes for extremitypathfinder-1.1.0-py36-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | f0318d9d43436eb0f8d91ffe8fb8c44f7ab4d5d6fe04066799b76d6b0e41e03a |
|
| MD5 | a3e718068b6c78dfc96e82480542db3b |
|
| BLAKE2b-256 | a6eb36edcec12798ca8f7c5096119f58422ecc8f0d806142a69f990530f8e386 |
