alecjacobson / libigl-tinyad-example
☆21Updated last year
Alternatives and similar repositories for libigl-tinyad-example:
Users that are interested in libigl-tinyad-example are comparing it to the libraries listed below
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 2 years ago
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- ☆51Updated 11 months ago
- ☆39Updated 3 years ago
- ☆21Updated last year
- ☆31Updated 11 months ago
- ☆31Updated 2 years ago
- Gradients/Hessians for optimizing with rotation variables.☆26Updated 2 years ago
- ☆20Updated 3 years ago
- Gaggle of Algorithms and Utilities for Simulating Stuff☆31Updated 2 years ago
- This is a simple version including dense sovler only.☆23Updated 3 years ago
- Implementation of Monte Carlo Geometry Processing☆23Updated 4 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆55Updated last year
- The author's Implementation of "Surface-Only Dynamic Deformables using a Boundary Element Method."☆37Updated 2 years ago
- ☆54Updated 5 years ago
- An implementation of "Air Meshes for Robust Collision Handling", SIGGRAPH (2015)☆15Updated 7 years ago
- Code for fast approximate generalized winding number (solid angle) computation for triangle soups☆14Updated 3 years ago
- Stark is a C++ and Python simulation platform for the robust simulation of rigid and deformable objects in a strongly coupled manner.☆50Updated 4 months ago
- ☆21Updated 3 years ago
- ☆17Updated 5 years ago
- The source code of the paper An Eigenanalysis of Angle-Based Deformation Energies☆17Updated last year
- Corresponding Code for the SIGGRAPH Asia paper "Nested Cages"☆82Updated last year
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆49Updated 9 months ago
- ☆11Updated 8 years ago
- ☆31Updated 3 years ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆16Updated last week
- An example that complies and runs the fast winding number for soups☆72Updated 6 years ago
- Code for the Siggraph 2023 Paper: Shortest Path to Boundary for Self-Intersecting Meshes☆89Updated last year
- ☆60Updated 7 months ago
- ☆26Updated 2 years ago