mhdadk / sutherland-hodgman
A differentiable Python implementation of the Sutherland–Hodgman algorithm for clipping polygons in 2D.
☆38Updated 2 years ago
Related projects ⓘ
Alternatives and complementary repositories for sutherland-hodgman
- Optimal Oriented Bounding Boxes algorithms☆45Updated 5 years ago
- Light C++11 graph library☆12Updated 3 years ago
- Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.☆57Updated 5 years ago
- C++ Library for Planar Visibility Computations☆26Updated last year
- Public code release for "Swept Volumes via Spacetime Numerical Continuation", presented at SIGGRAPH 2021 and authored by Silvia Sellán, N…☆55Updated 3 months ago
- A gpu based implementation of a K-D Tree Builder☆96Updated 5 years ago
- Simple didactic code + tutorial for the Walk on Stars (WoSt) algorithm☆82Updated last year
- Python package for creating interpolating splines (for position and rotation)☆58Updated 3 months ago
- A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.☆29Updated 3 months ago
- A fast, scalable and light-weight C++ Fréchet and DTW distance library, exposed to python and focused on clustering of polygonal curves.☆46Updated last year
- ☆24Updated 3 years ago
- Automatic Differentiation in Geometry Processing Made Simple☆372Updated 2 weeks ago
- Code examples for automatic differentiation with TinyAD☆27Updated 10 months ago
- ☆47Updated 4 months ago
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆131Updated 9 months ago
- ☆53Updated last year
- An easily integrable Cholesky solver on CPU and GPU☆224Updated this week
- tiny toy rigid body sim in python☆34Updated 2 years ago
- ☆71Updated 3 weeks ago
- A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library☆18Updated 4 years ago
- Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.☆96Updated last year
- Fast zero-overhead bindings between NumPy and Eigen☆138Updated 2 months ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆48Updated last month
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 3 years ago
- Class project for COMP-781, Robotics. This is a CUDA-based collision detector for motion planning.☆10Updated 5 years ago
- Ponca (fomerly known as Patate) is a header only C++/CUDA library for point cloud analysis☆32Updated 2 weeks ago
- C++11 code for building a 3D occupancy grid an SDF 3D grid from a mesh☆44Updated 3 years ago
- An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.☆123Updated 2 years ago
- A collection of utility functions to prototype geometry processing research in python☆201Updated 2 weeks ago
- Python wrapper for the OptiX 7 raytracing engine using Cython.☆23Updated last year