ingowald / closestSurfacePointQueries
Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point
☆24Updated 3 years ago
Alternatives and similar repositories for closestSurfacePointQueries:
Users that are interested in closestSurfacePointQueries are comparing it to the libraries listed below
- C++ library for fast computation of neighbor lists in point clouds.☆55Updated 2 months ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆19Updated this week
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆56Updated last year
- ☆39Updated 2 years ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 2 years ago
- Code for paper "P2M: A Fast Solver for Querying Distance from Point to Mesh Surface". ACM TOG (SIGGRAPH 2023).☆20Updated 4 months ago
- ☆50Updated 9 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆54Updated last year
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…☆27Updated 3 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆78Updated last year
- Gradients/Hessians for optimizing with rotation variables.☆26Updated last year
- ☆56Updated 5 months ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 3 years ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆14Updated 4 months ago
- An example that complies and runs the fast winding number for soups☆69Updated 6 years ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆49Updated 7 months ago
- Fast CUDA 3x3 SVD☆70Updated 6 years ago
- ADMM ⊇ Projective Dynamics: Fast Simulation of Hyperelastic Models with Dynamic Constraints☆88Updated 4 years ago
- ☆31Updated 9 months ago
- Indirect Predicates for Geometric Constructions☆45Updated last week
- Author's implementation of SIGGRAPH 2023 paper, "A Practical Walk-on-Boundary Method for Boundary Value Problems."☆53Updated last year
- A library for various continuous collision detection algorithms.☆57Updated last year
- A simple finite-difference library using Eigen.☆33Updated last year
- ☆20Updated 3 years ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆28Updated 2 years ago
- Signed Distance Function from triangle mesh.☆92Updated 5 years ago
- ☆54Updated 5 years ago
- FastCorotatedFEM is a minimalistic implementation of the corotated FEM method which was proposed in paper "Fast Corotated FEM using Opera…☆75Updated 5 years ago
- Stark is a C++ and Python simulation platform for the robust simulation of rigid and deformable objects in a strongly coupled manner.☆43Updated 2 months ago