mhdadk / sutherland-hodgman
A differentiable Python implementation of the Sutherland–Hodgman algorithm for clipping polygons in 2D.
☆41Updated 2 years ago
Alternatives and similar repositories for sutherland-hodgman:
Users that are interested in sutherland-hodgman are comparing it to the libraries listed below
- Fast python implementation of the quadric mesh simplification algorithm from http://mgarland.org/files/papers/quadrics.pdf☆108Updated 11 months ago
- Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.☆59Updated 6 years ago
- Fork of https://sourceforge.net/projects/imatistl/☆16Updated 6 years ago
- OBB implementation in python (using numpy)☆80Updated last year
- Fast Quadratic Mesh Simplification☆122Updated this week
- BVH: Bounding-Volume-Hierarchy☆25Updated 5 years ago
- Python bindings for Polyscope☆39Updated last month
- A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.☆31Updated last month
- Fast zero-overhead bindings between NumPy and Eigen☆139Updated 6 months ago
- A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al☆52Updated 5 months ago
- Curvature assignment for Geometry Processing course☆153Updated last year
- ☆144Updated last year
- Plot 3D triangle meshes☆151Updated 7 months ago
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆134Updated last year
- An awesome list of tools available in 3d computer graphics for the research in computer graphics/vision and machine learning☆23Updated last year
- A very fast 2D concave hull algorithm, for python☆28Updated 2 months ago
- A gpu based implementation of a K-D Tree Builder☆108Updated 5 years ago
- inversecsg code from paper https://dl.acm.org/citation.cfm?id=3275006 adapted to generate node-occ-csg-editor code☆3Updated 2 years ago
- An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.☆128Updated 2 years ago
- Compute the exact Euclidean Distance Transform and Voronoi Diagram for 2D and 3D binary images using the GPU.☆75Updated 4 years ago
- Course material for CMU course on Monte Carlo Methods and Applications☆24Updated last year
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆150Updated 6 years ago
- GPU Accelerated Motion Engine based on Taichi Lang.☆61Updated 3 years ago
- tiny toy rigid body sim in python☆34Updated 2 years ago
- Public code release for "Swept Volumes via Spacetime Numerical Continuation", presented at SIGGRAPH 2021 and authored by Silvia Sellán, N…☆56Updated 7 months ago
- 3D Signed Distance Field☆39Updated 3 years ago
- C++ demo of the Vector Heat Method (Sharp, Soliman, and Crane. 2019.)☆62Updated 4 years ago
- Python Wrapper for Embree☆90Updated last year
- ☆83Updated 10 months ago
- Robust, intersection-free, simulations of rigid bodies.☆158Updated 3 months ago