Alternatives and similar repositories for isect_segments-bentley_ottmann:

Users that are interested in isect_segments-bentley_ottmann are comparing it to the libraries listed below

• drufat / triangle
  Python bindings to the triangle library
  ☆238Updated 2 months ago
• scikit-geometry / scikit-geometry
  Scientific Python Geometric Algorithms Library
  ☆432Updated last year
• cansik / LongLiveTheSquare
  An algorithm to find the minimum bounding box.
  ☆78Updated 3 years ago
• linuxlewis / tripy
  Simple polygon triangulation algorithms in pure python
  ☆64Updated 5 years ago
• tudelft3d / masbcpp
  C++ implementation of the Medial Axis Shrinking Ball algorithm
  ☆121Updated 4 years ago
• kirill-terekhov / SweepLine
  Implementation of sweep line algorithm for intersection of segments
  ☆16Updated 8 years ago
• sadaszewski / concaveman-cpp
  C++ port of mapbox's JS concaveman, with a Python wrapper
  ☆158Updated 2 years ago
• CGAL / cgal-swig-bindings
  CGAL bindings using SWIG
  ☆371Updated 2 months ago
• lycantropos / sect
  Geometric partitioning (triangulation, trapezoidal decomposition)
  ☆28Updated last year
• sciencectn / cgal-bindings
  CGAL bindings using SWIG
  ☆29Updated last year
• FlorisSteenkamp / MAT
  Medial Axis Transform - Library
  ☆133Updated 11 months ago
• skogler / mapbox_earcut_python
  Python bindings to the mapbox earcut C++ library.
  ☆39Updated 2 months ago
• Botffy / polyskel
  Straight skeleton implementation in Python
  ☆80Updated 4 years ago
• charliermarsh / point-location
  Kirkpatrick's Algorithm for Log(n) point location in planar subdivisions.
  ☆70Updated 11 years ago
• HakanSeven12 / Delaunator-Python
  Fast Delaunay triangulation of 2D points implemented in Python.
  ☆51Updated 9 months ago
• fonttools / pyclipper
  Cython wrapper for the C++ translation of the Angus Johnson's Clipper library (ver. 6.4.2)
  ☆241Updated 4 months ago
• jan-mue / geometer
  A geometry library written in Python
  ☆106Updated last month
• jmespadero / pyDelaunay2D
  A simple Delaunay 2D triangulation in python (with numpy)
  ☆193Updated last year
• szabolcsdombi / headless-moderngl-experiment
  Headless 3D rendering with python
  ☆60Updated 5 years ago
• bengolder / python-geometry
  A 2D and 3D geometry library in python
  ☆53Updated 10 years ago
• sasamil / PointInPolygon_Py
  Improved agorithm for determining the inclusion of a point P in a 2D planar polygon. Python implementation.
  ☆30Updated 3 years ago
• BebeSparkelSparkel / MinimumBoundingBox
  Finds the minimum bounding box from a point cloud.
  ☆83Updated 6 years ago
• pglauner / point_in_polygon
  Implementation of "A Simple and Correct Even-Odd Algorithm for the Point-in-Polygon Problem for Complex Polygons"
  ☆36Updated 7 years ago
• mikhaildubov / computational-geometry
  Computational geometry algorithms in Java
  ☆129Updated 9 years ago
• kip-hart / AABBTree
  Pure Python implementation of d-dimensional AABB tree.
  ☆65Updated last year
• adamlwgriffiths / Pyrr
  3D mathematical functions using NumPy
  ☆408Updated 4 months ago
• dbworth / minimum-area-bounding-rectangle
  Find the minimum area bounding box that can be fitted to a set of points. Self-contained implementations in Python & Matlab.
  ☆63Updated 2 years ago
• cdcseacave / VCG
  The Visualization and Computer Graphics Library (VCG) fork of
  ☆47Updated 2 years ago
• artem-ogre / PythonCDT
  Constrained Delaunay Triangulation (Python)
  ☆41Updated 10 months ago
• ashwin / gStar4D
  Computes the 3D Delaunay triangulation on the GPU
  ☆126Updated 3 years ago