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

• scikit-geometry / scikit-geometry
  Scientific Python Geometric Algorithms Library
  ☆448Updated last year
• sadaszewski / concaveman-cpp
  C++ port of mapbox's JS concaveman, with a Python wrapper
  ☆173Updated 2 years ago
• trevorprater / pymorton
  A lightweight and efficient Python Morton encoder with support for geo-hashing
  ☆116Updated 2 years ago
• drufat / triangle
  Python bindings to the triangle library
  ☆252Updated 11 months ago
• cansik / LongLiveTheSquare
  An algorithm to find the minimum bounding box.
  ☆80Updated 4 years ago
• CGAL / cgal-swig-bindings
  CGAL bindings using SWIG
  ☆386Updated 3 weeks ago
• BebeSparkelSparkel / MinimumBoundingBox
  Finds the minimum bounding box from a point cloud.
  ☆84Updated 7 years ago
• fonttools / pyclipper
  Cython wrapper for the C++ translation of the Angus Johnson's Clipper library (ver. 6.4.2)
  ☆256Updated 2 weeks ago
• jmespadero / pyDelaunay2D
  A simple Delaunay 2D triangulation in python (with numpy)
  ☆200Updated last year
• rohan-sawhney / medial-axis-transform-2d
  2d medial axis transform using tracing paths [Joan-Arinyo et al.]
  ☆34Updated 6 years ago
• tudelft3d / masbcpp
  C++ implementation of the Medial Axis Shrinking Ball algorithm
  ☆127Updated 4 years ago
• linuxlewis / tripy
  Simple polygon triangulation algorithms in pure python
  ☆66Updated 6 years ago
• HakanSeven12 / Delaunator-Python
  Fast Delaunay triangulation of 2D points implemented in Python.
  ☆57Updated last year
• ezag / pyeuclid
  2D and 3D maths module for Python
  ☆97Updated 7 years ago
• Botffy / polyskel
  Straight skeleton implementation in Python
  ☆86Updated 5 years ago
• cubao / concave_hull
  A very fast 2D concave hull algorithm, for python, https://deepwiki.com/cubao/concave_hull/
  ☆32Updated last year
• cnr-isti-vclab / meshlabjs
  A javascript client based mesh processing tool. Built using vcg library, emscripten and webgl
  ☆241Updated 3 years ago
• fhirschmann / rdp
  Python/Numpy implementation of the Ramer-Douglas-Peucker algorithm
  ☆257Updated 8 months ago
• dhermes / bezier
  Helper for Bézier Curves, Triangles, and Higher Order Objects
  ☆279Updated 11 months ago
• karimbahgat / Pyqtree
  A pure Python quad tree spatial index for GIS or rendering usage
  ☆129Updated 5 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆174Updated 7 years ago
• sciencectn / cgal-bindings
  CGAL bindings using SWIG
  ☆28Updated 2 years ago
• SINTEF / Splipy
  Spline modelling made easy.
  ☆112Updated last week
• ashwin / gStar4D
  Computes the 3D Delaunay triangulation on the GPU
  ☆133Updated 4 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆143Updated 8 months ago
• volkerp / fitCurves
  Python implementation of Philip J. Schneider's "Algorithm for Automatically Fitting Digitized Curves" from the book "Graphics Gems"
  ☆188Updated 5 years ago
• ajhynes7 / scikit-spatial
  Spatial objects and computations based on NumPy arrays.
  ☆100Updated 7 months ago
• kip-hart / AABBTree
  Pure Python implementation of d-dimensional AABB tree.
  ☆66Updated last year
• sasamil / PointInPolygon_Py
  Improved agorithm for determining the inclusion of a point P in a 2D planar polygon. Python implementation.
  ☆30Updated 4 years ago
• bellockk / alphashape
  Toolbox for constructing alpha shapes.
  ☆306Updated 2 months ago