Skip to main content

python package for fast shortest path computation on 2D polygon or grid maps

Project description documentation status pre-commit Total PyPI downloads latest version on PyPI

python package for fast geometric shortest path computation in 2D multi-polygon or grid environments based on visibility graphs.


Quick Guide:

Install the package with the optional Numba extra for a significant speedup:

pip install extremitypathfinder[numba]
from extremitypathfinder import PolygonEnvironment

environment = PolygonEnvironment()
# counter clockwise vertex numbering!
boundary_coordinates = [(0.0, 0.0), (10.0, 0.0), (9.0, 5.0), (10.0, 10.0), (0.0, 10.0)]
# clockwise numbering!
list_of_holes = [
        (3.0, 7.0),
        (5.0, 9.0),
        (4.5, 7.0),
        (5.0, 4.0),
], list_of_holes, validate=False)
start_coordinates = (4.5, 1.0)
goal_coordinates = (4.0, 8.5)
path, length = environment.find_shortest_path(start_coordinates, goal_coordinates)

For more refer to the documentation.

Also see: GitHub, PyPI

Project details

Download files

Download the file for your platform. If you're not sure which to choose, learn more about installing packages.

Source Distribution

extremitypathfinder-2.7.2.tar.gz (40.3 kB view hashes)

Uploaded Source

Built Distribution

extremitypathfinder-2.7.2-py3-none-any.whl (47.9 kB view hashes)

Uploaded Python 3

Supported by

AWS AWS Cloud computing and Security Sponsor Datadog Datadog Monitoring Fastly Fastly CDN Google Google Download Analytics Microsoft Microsoft PSF Sponsor Pingdom Pingdom Monitoring Sentry Sentry Error logging StatusPage StatusPage Status page