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
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.0.0.tar.gz
(28.2 kB
view hashes)
Built Distribution
Close
Hashes for extremitypathfinder-1.0.0.tar.gz
Algorithm | Hash digest | |
---|---|---|
SHA256 | f26159550b4d4fa9c996dfe8494c1eb7ee63413a69a1a882aa92dac4c8335c50 |
|
MD5 | f607328a6bbe2b51afca442866b589f0 |
|
BLAKE2b-256 | 2087a67d4fca55b76f488cc225fb9151308564765b953d79b265d3c7f6a16314 |
Close
Hashes for extremitypathfinder-1.0.0-py36-none-any.whl
Algorithm | Hash digest | |
---|---|---|
SHA256 | 86d920ed98eba38d64f0643057a6cd2fa720ea78a28eb707e203d8645a83612c |
|
MD5 | 86ea7fbeccae74b690b5c333cfa09a6c |
|
BLAKE2b-256 | 76ca3096869156f3570663912961f02b971f2843ad92b580c1ae7e578a09e5fb |