InteractiveComputerGraphics / TreeNSearchLinks
C++ library for fast computation of neighbor lists in point clouds.
☆57Updated 8 months ago
Alternatives and similar repositories for TreeNSearch
Users that are interested in TreeNSearch are comparing it to the libraries listed below
Sorting:
- Convex Polyhedral Meshing for Robust Solid Modeling☆57Updated 2 weeks ago
- ☆67Updated 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
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆145Updated 3 months ago
- A library for various continuous collision detection algorithms.☆59Updated 2 years ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆17Updated 4 months ago
- 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☆83Updated 2 years ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 3 years ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- Cross-platform C++ library of algorithms and data structures commonly used in computer graphics research on physically-based simulation w…☆53Updated last month
- Indirect Predicates for Geometric Constructions☆47Updated 3 months ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆30Updated last week
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆79Updated 2 years ago
- Hierarchical Optimization Time Integration (HOT) for efficient implicit timestepping of the material point method (MPM)☆100Updated 5 years ago
- Stark is a C++ and Python simulation platform for the robust simulation of rigid and deformable objects in a strongly coupled manner.☆59Updated 9 months ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆176Updated last year
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆169Updated last month
- Optimization-based implicit material point method☆47Updated 8 months ago
- Affine Particle-in-Cell Water Simulation in 2D☆120Updated last year
- Introduction to state-of-the-art simulation methods for rigid bodies, deformable solids and fluids in the area of visual computing☆59Updated last year
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆106Updated last year
- This is the header-only version of the code we used for the experiments in the paper "Fast and Robust Mesh Arrangements using Floating-po…☆160Updated last year
- ☆51Updated last year
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last month
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆20Updated 10 months ago
- The finite element method for 3D elastic objects☆56Updated 4 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
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆28Updated 3 years ago
- This is a fast GPU SPH framework☆21Updated last month