kip-hart / AABBTreeLinks
Pure Python implementation of d-dimensional AABB tree.
☆66Updated last week
Alternatives and similar repositories for AABBTree
Users that are interested in AABBTree are comparing it to the libraries listed below
Sorting:
- Fast Delaunay triangulation of 2D points implemented in Python.☆57Updated last year
- 2D and 3D computational geometry library☆32Updated last year
- Spline modelling made easy.☆112Updated last month
- Python bindings to the triangle library☆258Updated last year
- A library of geometry processing tools for computer graphics☆114Updated last week
- Python Wrapper for Embree☆95Updated 2 years ago
- COMPAS package for working with CGAL.☆29Updated last week
- Octree structure containing a 3D triangular mesh model☆95Updated 4 years ago
- Robust geometric predicates☆64Updated last year
- Fast zero-overhead bindings between NumPy and Eigen☆143Updated 10 months ago
- Python package for creating interpolating splines (for position and rotation)☆79Updated last month
- Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.☆108Updated 2 years ago
- 2d medial axis transform using tracing paths [Joan-Arinyo et al.]☆35Updated 6 years ago
- Python implementation of surface mesh resampling algorithm ACVD☆284Updated last month
- 3D mathematical functions using NumPy☆419Updated last year
- Scientific Python Geometric Algorithms Library☆448Updated 2 years ago
- A Python interface to the C++ TetGen library to generate tetrahedral meshes of any 3D polyhedral domains☆288Updated 2 weeks ago
- Compute interesting points, areas, and volumes in simplex meshes of any dimension.☆108Updated 6 months ago
- A python COLLADA library. Can be used to create, edit and load COLLADA documents.☆249Updated 2 weeks ago
- A tiny sotfware 3D renderer in 100 lines of Python☆181Updated 6 years ago
- Python bindings for TriWild.☆55Updated last year
- A python library for fast prototyping in geometry processing.☆34Updated 2 years ago
- A short, reasonnably simple, fast, and robust function to determine if a set of points are inside a 3d mesh☆78Updated 6 years ago
- A nano spline library in modern C++.☆130Updated 2 months ago
- A collection of meshes for canonical domains☆334Updated 2 years ago
- Python bindings for Polyscope☆51Updated this week
- A C++ geometry processing library☆52Updated 4 years ago
- Fill 2D regions with traversals for generating tool paths☆30Updated 4 years ago
- C++ implementation of the Medial Axis Shrinking Ball algorithm☆128Updated 5 years ago
- Fast Quadratic Mesh Simplification☆187Updated last week