InteractiveComputerGraphics / TreeNSearch
C++ library for fast computation of neighbor lists in point clouds.
☆55Updated 2 months ago
Alternatives and similar repositories for TreeNSearch:
Users that are interested in TreeNSearch are comparing it to the libraries listed below
- Stark is a C++ and Python simulation platform for the robust simulation of rigid and deformable objects in a strongly coupled manner.☆44Updated 3 months ago
- Fork of "stark" with source code for our paper "Curved Three-Director Cosserat Shells with Strong Coupling"☆14Updated 2 months ago
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- ☆57Updated 6 months ago
- A library for various continuous collision detection algorithms.☆58Updated last year
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 2 years ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆14Updated 4 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆55Updated last year
- Indirect Predicates for Geometric Constructions☆45Updated 2 weeks ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆78Updated last year
- FastCorotatedFEM is a minimalistic implementation of the corotated FEM method which was proposed in paper "Fast Corotated FEM using Opera…☆75Updated 5 years ago
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- ☆39Updated 2 years ago
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆17Updated 4 months ago
- Affine Particle-in-Cell Water Simulation in 2D☆115Updated last year
- Code for the Siggraph 2023 Paper: Shortest Path to Boundary for Self-Intersecting Meshes☆86Updated last year
- Optimization-based implicit material point method☆42Updated 2 months ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆138Updated 8 months ago
- Easy-to-use linear and non-linear solver☆51Updated 2 weeks ago
- Author's implementation of SIGGRAPH 2023 paper, "A Practical Walk-on-Boundary Method for Boundary Value Problems."☆53Updated last year
- This is the fastest GPU SPH framework☆15Updated 11 months ago
- Code for paper "P2M: A Fast Solver for Querying Distance from Point to Mesh Surface". ACM TOG (SIGGRAPH 2023).☆20Updated 5 months ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆167Updated 6 months ago
- Robust Coarse Curved TetMesh Generation☆35Updated last year
- Signed Distance Function from triangle mesh.☆92Updated 5 years ago
- ☆50Updated 9 months ago
- ☆25Updated 2 years ago
- A quantization method for volumetric parametrizations based on the MC3D☆15Updated 3 weeks ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆99Updated 9 months ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆20Updated this week