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 11 months ago
- ☆39Updated 3 years ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆39Updated 2 weeks ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆27Updated 3 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆60Updated 3 weeks ago
- ☆52Updated last year
- ☆72Updated 2 months ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆61Updated 4 months ago
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆35Updated 3 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆85Updated 2 years ago
- Fast CUDA 3x3 SVD☆77Updated 7 years ago
- ☆129Updated 5 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
- Gradients/Hessians for optimizing with rotation variables.☆27Updated 2 years 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
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- ☆14Updated 11 months ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- ☆55Updated 6 years ago
- Implementation of our paper "Polygon Laplacian Made Simple", Eurographics 2020.☆38Updated 4 years ago
- ☆31Updated last year
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆107Updated last year
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆29Updated 3 years ago
- Public code release for the SIGGRAPH Asia 2020 paper "Opening and Closing Surfaces", authored by Silvia Sellán, Ang Yan Sheng, Jacob Kest…☆24Updated 2 months ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆17Updated last month
- Signed Distance Function from triangle mesh.☆94Updated 6 years ago
- gQuery: Fast CPU and GPU-Accelerated Geometry Queries☆20Updated 7 months ago
- ☆20Updated 4 years ago
- Command Line Tools for Geometry Processing☆42Updated last year