InteractiveComputerGraphics / TreeNSearchLinks
C++ library for fast computation of neighbor lists in point clouds.
☆60Updated last month
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 4 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆180Updated last month
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆39Updated 3 months ago
- A library for various continuous collision detection algorithms.☆60Updated 2 years ago
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆172Updated 4 months ago
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆35Updated 3 years ago
- Affine Particle-in-Cell Water Simulation in 2D☆121Updated 2 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆61Updated last month
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆19Updated 3 months ago
- Optimization-based implicit material point method☆56Updated last month
- Hierarchical Optimization Time Integration (HOT) for efficient implicit timestepping of the material point method (MPM)☆103Updated 5 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆87Updated 2 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆152Updated last week
- ☆77Updated last month
- Stark is a C++ and Python simulation platform for the robust simulation of rigid and deformable objects in a strongly coupled manner.☆65Updated this week
- ☆52Updated last year
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆109Updated last year
- A simple BVH data structure.☆22Updated 2 months ago
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆79Updated 2 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆61Updated 7 months ago
- This is a fast GPU SPH framework☆21Updated 6 months ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆27Updated 3 years ago
- Indirect Predicates for Geometric Constructions☆50Updated last month
- 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…☆58Updated this week
- An algorithm for Structured Volume Decomposition☆39Updated 10 months ago
- ☆39Updated 3 years ago
- The finite element method for 3D elastic objects☆56Updated 5 years ago
- FastCorotatedFEM is a minimalistic implementation of the corotated FEM method which was proposed in paper "Fast Corotated FEM using Opera…☆78Updated 6 years ago
- Code for the Siggraph 2023 Paper: Shortest Path to Boundary for Self-Intersecting Meshes☆94Updated last year