InteractiveComputerGraphics / TreeNSearchLinks
C++ library for fast computation of neighbor lists in point clouds.
☆57Updated 7 months ago
Alternatives and similar repositories for TreeNSearch
Users that are interested in TreeNSearch are comparing it to the libraries listed below
Sorting:
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 3 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆57Updated last month
- ☆63Updated last month
- Fork of "stark" with source code for our paper "Curved Three-Director Cosserat Shells with Strong Coupling"☆17Updated 7 months ago
- ☆39Updated 3 years ago
- Affine Particle-in-Cell Water Simulation in 2D☆118Updated last year
- Stark is a C++ and Python simulation platform for the robust simulation of rigid and deformable objects in a strongly coupled manner.☆56Updated 7 months ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆17Updated 3 months ago
- Cross-platform C++ library of algorithms and data structures commonly used in computer graphics research on physically-based simulation w…☆50Updated 2 weeks ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- ☆51Updated last year
- Optimization-based implicit material point method☆47Updated 7 months ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆106Updated last year
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆29Updated this week
- ☆26Updated 2 years ago
- A simple BVH data structure.☆17Updated 11 months ago
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆78Updated last year
- Hierarchical Optimization Time Integration (HOT) for efficient implicit timestepping of the material point method (MPM)☆99Updated 5 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆144Updated last month
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆174Updated 10 months ago
- Signed Distance Function from triangle mesh.☆93Updated 6 years ago
- The author's Implementation of "Surface-Only Dynamic Deformables using a Boundary Element Method."☆37Updated 2 years ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆28Updated 2 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆81Updated 2 years ago
- Robust Coarse Curved TetMesh Generation☆36Updated last year
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last week
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆169Updated this week
- Code for the Siggraph 2023 Paper: Shortest Path to Boundary for Self-Intersecting Meshes☆91Updated last year