ideasman42 / isect_segments-bentley_ottmannLinks
BentleyOttmann sweep-line implementation (for finding all intersections in a set of line segments)
☆105Updated 10 months ago
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
Sorting:
- A pure Python quad tree spatial index for GIS or rendering usage☆128Updated 4 years ago
- Python bindings to the triangle library☆249Updated 9 months ago
- C++ port of mapbox's JS concaveman, with a Python wrapper☆169Updated 2 years ago
- Python/Numpy implementation of the Ramer-Douglas-Peucker algorithm☆254Updated 6 months ago
- Python implementation of Philip J. Schneider's "Algorithm for Automatically Fitting Digitized Curves" from the book "Graphics Gems"☆187Updated 5 years ago
- Pure Python implementation of d-dimensional AABB tree.☆66Updated last year
- A lightweight and efficient Python Morton encoder with support for geo-hashing☆115Updated 2 years ago
- Helper for Bézier Curves, Triangles, and Higher Order Objects☆279Updated 10 months ago
- A simple Delaunay 2D triangulation in python (with numpy)☆198Updated last year
- Cython wrapper for the C++ translation of the Angus Johnson's Clipper library (ver. 6.4.2)☆254Updated last month
- Python implementation of the Bentley-Ottmann algorithm for 2d line segment intersection, described in de Berg et al., Ch. 2.☆25Updated 10 years ago
- Simple polygon triangulation algorithms in pure python☆66Updated 6 years ago
- Finds the minimum bounding box from a point cloud.☆84Updated 7 years ago
- C++ implementation of the Medial Axis Shrinking Ball algorithm☆127Updated 4 years ago
- Scientific Python Geometric Algorithms Library☆446Updated last year
- A javascript client based mesh processing tool. Built using vcg library, emscripten and webgl☆241Updated 3 years ago
- Python module for projective camera model☆53Updated 8 years ago
- 3D mathematical functions using NumPy☆418Updated last year
- Improved agorithm for determining the inclusion of a point P in a 2D planar polygon. Python implementation.☆30Updated 4 years ago
- Find the minimum area bounding box that can be fitted to a set of points. Self-contained implementations in Python & Matlab.☆63Updated 3 years ago
- build concave hull from points☆53Updated 10 years ago
- Find the maximally inscribed, axis-aligned rectangle for a given polygon☆48Updated 3 years ago
- a python module to compute straight skeletons☆16Updated 8 years ago
- Very fast Python line simplification using either the RDP or Visvalingam-Whyatt algorithm implemented in Rust☆190Updated last week
- Port of MapBox's polylabel☆53Updated 6 years ago
- 2D and 3D maths module for Python☆97Updated 7 years ago
- CGAL bindings using SWIG☆385Updated this week
- An algorithm to find the minimum bounding box.☆81Updated 4 years ago
- Converter PointCloud Library <---> E57 file format☆38Updated 3 years ago
- Fast zero-overhead bindings between NumPy and Eigen☆143Updated 7 months ago