mhdadk / sutherland-hodgmanLinks
A differentiable Python implementation of the Sutherland–Hodgman algorithm for clipping polygons in 2D.
☆46Updated 3 years ago
Alternatives and similar repositories for sutherland-hodgman
Users that are interested in sutherland-hodgman are comparing it to the libraries listed below
Sorting:
- Fast zero-overhead bindings between NumPy and Eigen☆143Updated 10 months ago
- Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.☆60Updated 7 years ago
- Automatic Differentiation in Geometry Processing Made Simple☆422Updated 3 months ago
- Curvature assignment for Geometry Processing course☆156Updated 2 years ago
- This is accompanying code for our JCGT / I3D paper, "A Dataset and Explorer for 3D Signed Distance Functions (SDF)".☆274Updated 3 years ago
- An easily integrable Cholesky solver on CPU and GPU☆255Updated 3 weeks ago
- An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.☆142Updated 3 years ago
- Robust, intersection-free, simulations of rigid bodies.☆176Updated 7 months ago
- A collection of utility functions to prototype geometry processing research in python☆257Updated 4 months ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆180Updated last month
- Compute the exact Euclidean Distance Transform and Voronoi Diagram for 2D and 3D binary images using the GPU.☆80Updated 5 years ago
- C++ implementation of the Surface Winding Numbers algorithm, which computes inside-outside on general surfaces.☆57Updated last year
- Python bindings for Polyscope☆51Updated this week
- A fast nearest neighbor index cuda implementation for 3-D points using a left balanced BVH-tree.☆32Updated last year
- Simple didactic code + tutorial for the Walk on Stars (WoSt) algorithm☆100Updated 2 years ago
- Lightweight Physically-Based Renderer designed for ease of use and fast prototyping☆115Updated 2 years ago
- Fast Quadratic Mesh Simplification☆186Updated this week
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆176Updated 2 years ago
- Geometry3D: 3D Computational Geometrics Library☆96Updated 11 months ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆176Updated 7 years ago
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆147Updated last year
- Queries on neural implicit surfaces via range analysis: ray casting, intersection, closest point, & more. SIGGRAPH 2022 paper. JAX implem…☆180Updated 3 years ago
- MeshTaichi: A Compiler for Efficient Mesh-based Operations (SIGGRAPH Asia 2022)☆254Updated 2 years ago
- C++ library implementing the Signed Heat Method for computing robust signed distance fields (SDFs) to triangle meshes, polygon meshes, an…☆141Updated 2 months ago
- CUDA-accelerated LOD construction for point clouds☆155Updated 2 years ago
- Fusing Taichi into PyTorch☆145Updated 3 years ago
- Signed Distance Function from triangle mesh.☆95Updated 6 years ago
- Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.☆108Updated 2 years ago
- Python Wrapper for Nvidia PhysX simulator.☆112Updated 2 years ago
- Generate watertight meshes and sdf grids from degenerate, non-manifold meshes☆108Updated 2 years ago