InteractiveComputerGraphics / TreeNSearch
C++ library for fast computation of neighbor lists in point clouds.
☆56Updated 3 months ago
Alternatives and similar repositories for TreeNSearch:
Users that are interested in TreeNSearch are comparing it to the libraries listed below
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 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
- A library for various continuous collision detection algorithms.☆58Updated 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
- Optimization-based implicit material point method☆42Updated 3 months ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 2 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆56Updated last year
- ☆51Updated 10 months ago
- Fork of "stark" with source code for our paper "Curved Three-Director Cosserat Shells with Strong Coupling"☆14Updated 4 months ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆80Updated last year
- Indirect Predicates for Geometric Constructions☆45Updated last month
- ☆39Updated 3 years ago
- ☆36Updated 6 years ago
- Affine Particle-in-Cell Water Simulation in 2D☆115Updated last year
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- ☆26Updated 2 years ago
- ☆58Updated 7 months ago
- Introduction to state-of-the-art simulation methods for rigid bodies, deformable solids and fluids in the area of visual computing☆50Updated 7 months ago
- Hierarchical Optimization Time Integration (HOT) for efficient implicit timestepping of the material point method (MPM)☆96Updated 4 years 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☆18Updated last year
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 3 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆138Updated 9 months ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆14Updated 5 months ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆99Updated 10 months ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆21Updated 2 weeks ago
- Cross-platform C++ library of algorithms and data structures commonly used in computer graphics research on physically-based simulation w…☆45Updated this week
- 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
- Robust Coarse Curved TetMesh Generation☆35Updated last year