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

• karimbahgat / Pyqtree
  A pure Python quad tree spatial index for GIS or rendering usage
  ☆128Updated 5 years ago
• sadaszewski / concaveman-cpp
  C++ port of mapbox's JS concaveman, with a Python wrapper
  ☆171Updated 2 years ago
• scikit-geometry / scikit-geometry
  Scientific Python Geometric Algorithms Library
  ☆447Updated last year
• splichte / lsi
  Python implementation of the Bentley-Ottmann algorithm for 2d line segment intersection, described in de Berg et al., Ch. 2.
  ☆25Updated 10 years ago
• drufat / triangle
  Python bindings to the triangle library
  ☆252Updated 10 months ago
• linuxlewis / tripy
  Simple polygon triangulation algorithms in pure python
  ☆66Updated 6 years ago
• BebeSparkelSparkel / MinimumBoundingBox
  Finds the minimum bounding box from a point cloud.
  ☆84Updated 7 years ago
• dhermes / bezier
  Helper for Bézier Curves, Triangles, and Higher Order Objects
  ☆279Updated 11 months ago
• cansik / LongLiveTheSquare
  An algorithm to find the minimum bounding box.
  ☆80Updated 4 years 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
• CGAL / cgal-swig-bindings
  CGAL bindings using SWIG
  ☆385Updated this week
• fonttools / pyclipper
  Cython wrapper for the C++ translation of the Angus Johnson's Clipper library (ver. 6.4.2)
  ☆254Updated 2 months ago
• adamlwgriffiths / Pyrr
  3D mathematical functions using NumPy
  ☆419Updated last year
• urschrei / simplification
  Very fast Python line simplification using either the RDP or Visvalingam-Whyatt algorithm implemented in Rust
  ☆191Updated last month
• snoyer / polygonskeletons
  a python module to compute straight skeletons
  ☆16Updated 8 years ago
• smidm / camera.py
  Python module for projective camera model
  ☆53Updated 8 years ago
• sasamil / PointInPolygon_Py
  Improved agorithm for determining the inclusion of a point P in a 2D planar polygon. Python implementation.
  ☆30Updated 4 years ago
• OpenStitching / lir
  Largest Interior/Inscribed Rectangle implementation in Python.
  ☆183Updated 2 weeks ago
• cnr-isti-vclab / meshlabjs
  A javascript client based mesh processing tool. Built using vcg library, emscripten and webgl
  ☆241Updated 3 years ago
• kip-hart / AABBTree
  Pure Python implementation of d-dimensional AABB tree.
  ☆66Updated last year
• HakanSeven12 / Delaunator-Python
  Fast Delaunay triangulation of 2D points implemented in Python.
  ☆57Updated last year
• skogler / mapbox_earcut_python
  Python bindings to the mapbox earcut C++ library.
  ☆40Updated last week
• FlorisSteenkamp / MAT
  Medial Axis Transform - Library
  ☆147Updated this week
• aewallin / openvoronoi
  2D voronoi diagram for point and line-segment sites using incremental topology-oriented algorithm. C++ with python bindings. Licensed und…
  ☆217Updated 2 years ago
• Botffy / polyskel
  Straight skeleton implementation in Python
  ☆86Updated 5 years ago
• planetlabs / maxrect
  Find the maximally inscribed, axis-aligned rectangle for a given polygon
  ☆48Updated 3 years ago
• ajhynes7 / scikit-spatial
  Spatial objects and computations based on NumPy arrays.
  ☆100Updated 6 months ago
• lace / vg
  Vector-geometry toolbelt for 3D points and vectors
  ☆123Updated 2 years ago
• jmespadero / pyDelaunay2D
  A simple Delaunay 2D triangulation in python (with numpy)
  ☆198Updated last year
• pogam / ExtractRect
  find the largest rectangle inscribed in a non-convex polygon
  ☆51Updated 4 years ago