Alternatives and similar repositories for Voronoi:

Users that are interested in Voronoi are comparing it to the libraries listed below

• jmespadero / pyDelaunay2D
  A simple Delaunay 2D triangulation in python (with numpy)
  ☆193Updated 11 months ago
• qwertyquerty / collision
  Collision is a python library meant for collision detection between convex and concave polygons, circles, and points.
  ☆71Updated 2 years ago
• TaipanRex / pyvisgraph
  Given a list of simple obstacle polygons, build the visibility graph and find the shortest path between two points
  ☆227Updated 4 years ago
• wsilva32 / poly_decomp.py
  Decompose 2D polygons into convex pieces.
  ☆27Updated 8 years ago
• jannikmi / extremitypathfinder
  python package for fast shortest path computation on 2D polygon or grid maps
  ☆44Updated last month
• Botffy / polyskel
  Straight skeleton implementation in Python
  ☆80Updated 4 years ago
• aewallin / openvoronoi
  2D voronoi diagram for point and line-segment sites using incremental topology-oriented algorithm. C++ with python bindings. Licensed und…
  ☆207Updated last year
• ezag / pyeuclid
  2D and 3D maths module for Python
  ☆96Updated 7 years ago
• reiniscimurs / Bezier-Curve
  Python class for creating and optimizing quadratic and cubic Bezier curves and path smoothing implementation.
  ☆38Updated 3 years ago
• karimbahgat / Pyqtree
  A pure Python quad tree spatial index for GIS or rendering usage
  ☆127Updated 4 years ago
• ross1573 / generalized_voronoi_diagram
  Generalized voronoi diagram for python
  ☆23Updated 4 months ago
• darienmt / FCND-Term1-P2-3D-Motion-Planning
  Udacity Flying Car Nanodegree - Term 1 - Project 2 - 3D Motion Planning
  ☆29Updated 6 years ago
• GavinPHR / Space-Time-AStar
  A* Search Algorithm with an Additional Time Dimension to Deal with Dynamic Obstacles
  ☆181Updated 3 years ago
• linuxlewis / tripy
  Simple polygon triangulation algorithms in pure python
  ☆64Updated 5 years ago
• akapkotel / light_raycasting
  Raycasting algorithm python implementation inspired by: https://www.redblobgames.com/articles/visibility/
  ☆37Updated last year
• mittalgovind / Polygon-Partition
  Python code for partitioning rectilinear polygon in O(n) time complexity
  ☆43Updated 7 years ago
• HakanSeven12 / Delaunator-Python
  Fast Delaunay triangulation of 2D points implemented in Python.
  ☆51Updated 9 months ago
• karlobermeyer / VisiLibity1
  C++ Library for Planar Visibility Computations
  ☆26Updated 2 years ago
• APLA-Toolbox / pymapf
  📍🗺️ A Python library for Multi-Agents Planning and Pathfinding (Centralized and Decentralized)
  ☆72Updated this week
• Nerdylicious / DijkstraShortestPath
  Implementation of Dijkstra's algorithm in C++ which finds the shortest path from a start node to every other node in a weighted graph.
  ☆39Updated 7 months ago
• caadxyz / DeBoorAlgorithmNurbs
  De Boor's Algorithm for NURBS Curve
  ☆51Updated 4 years ago
• USC-ACTLab / MAPFAST
  ☆20Updated 2 years ago
• bengolder / python-geometry
  A 2D and 3D geometry library in python
  ☆53Updated 10 years ago
• njanakiev / fortune-algorithm
  Implementation of Fortune's Algorithm in Processing
  ☆16Updated 7 years ago
• proto3 / cavaliercontours-python
  Python binding to the CavalierContours C++ library
  ☆13Updated 4 years ago
• ct2034 / cobra
  ☆27Updated 6 months ago
• snoyer / polygonskeletons
  a python module to compute straight skeletons
  ☆15Updated 7 years ago
• Kei18 / pibt2
  Priority Inheritance with Backtracking for Iterative Multi-agent Path Finding (AIJ-22)
  ☆67Updated 6 months ago
• torresjrjr / Bezier.py
  ➰ Create Bezier curves in Python [Mirror]
  ☆72Updated 3 years ago
• arnaud-ramey / voronoi
  VoronoiSkeleton is a C++ class made for the fast computing of Voronoi diagrams of monochrome images. It contains different implementation…
  ☆98Updated 5 years ago