ingowald / closestSurfacePointQueriesLinks
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
Sorting:
- C++ library for fast computation of neighbor lists in point clouds.☆55Updated 10 months ago
- ☆39Updated 3 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆60Updated last month
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆35Updated 3 weeks ago
- Fast CUDA 3x3 SVD☆76Updated 7 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated 3 months ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆27Updated 3 years ago
- ☆71Updated last month
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- ☆51Updated last year
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 3 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆84Updated 2 years ago
- Gradients/Hessians for optimizing with rotation variables.☆26Updated 2 years ago
- ☆31Updated last year
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆145Updated 4 months ago
- ADMM ⊇ Projective Dynamics: Fast Simulation of Hyperelastic Models with Dynamic Constraints☆92Updated 5 years ago
- A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…☆27Updated 4 years ago
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆78Updated 2 years ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆17Updated last month
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆106Updated last year
- ☆128Updated 4 months ago
- ☆55Updated 6 years ago
- ☆11Updated 9 months ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆169Updated 3 weeks ago
- Signed Distance Function from triangle mesh.☆94Updated 6 years ago
- injective mapping via TLC (total lifted content) energy minimization (SIGGRAPH 2020)☆19Updated 5 years ago
- Easy-to-use linear and non-linear solver☆54Updated 3 months ago
- gQuery: Fast CPU and GPU-Accelerated Geometry Queries☆20Updated 5 months ago
- FastCorotatedFEM is a minimalistic implementation of the corotated FEM method which was proposed in paper "Fast Corotated FEM using Opera…☆77Updated 6 years ago