sgsellan / swept-volumes
Public code release for "Swept Volumes via Spacetime Numerical Continuation", presented at SIGGRAPH 2021 and authored by Silvia Sellán, Noam Aigerman and Alec Jacobson
☆59Updated 8 months ago
Alternatives and similar repositories for swept-volumes:
Users that are interested in swept-volumes are comparing it to the libraries listed below
- SdfLib is a library for accelerating the queries of signed distance fields from triangle meshes☆49Updated 2 months ago
- Code for our Siggraph 24 Paper Differentiable Geodesic Distance for Intrinsic Minimization on Triangle Meshes☆33Updated last month
- ☆54Updated 5 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆138Updated 10 months ago
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- ☆58Updated 7 months ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆56Updated last year
- Signed Distance Function from triangle mesh.☆92Updated 5 years ago
- A library for performing proximity queries on a pair of geometric models composed of triangles☆72Updated 4 years ago
- ☆20Updated last year
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 3 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆172Updated 7 months ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆15Updated 6 months ago
- ☆17Updated 7 years ago
- A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…☆28Updated 3 years ago
- A library for various continuous collision detection algorithms.☆58Updated 2 years ago
- Source code for serveral papers on discrete Laplace operators on general polygons and polyhedral meshes☆37Updated 10 months ago
- Indirect Predicates for Geometric Constructions☆45Updated last month
- Code examples for automatic differentiation with TinyAD☆28Updated last year
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- Gradients/Hessians for optimizing with rotation variables.☆26Updated 2 years ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆29Updated 2 years ago
- Stark is a C++ and Python simulation platform for the robust simulation of rigid and deformable objects in a strongly coupled manner.☆48Updated 4 months ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆21Updated 3 weeks ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆49Updated 9 months ago
- Gaggle of Algorithms and Utilities for Simulating Stuff☆31Updated 2 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆55Updated last year
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆77Updated last year
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆53Updated 6 months ago
- ☆51Updated 11 months ago