InteractiveComputerGraphics / TreeNSearch
C++ library for fast computation of neighbor lists in point clouds.
☆57Updated 4 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.☆50Updated 4 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 library for various continuous collision detection algorithms.☆58Updated 2 years ago
- Fork of "stark" with source code for our paper "Curved Three-Director Cosserat Shells with Strong Coupling"☆14Updated 4 months ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆16Updated last week
- FastCorotatedFEM is a minimalistic implementation of the corotated FEM method which was proposed in paper "Fast Corotated FEM using Opera…☆75Updated 5 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆56Updated last week
- ☆51Updated 11 months ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆80Updated last year
- A quantization method for volumetric parametrizations based on the MC3D☆18Updated 2 months ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 2 years ago
- Indirect Predicates for Geometric Constructions☆45Updated 2 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆55Updated last year
- Optimization-based implicit material point method☆42Updated 4 months ago
- Cross-platform C++ library of algorithms and data structures commonly used in computer graphics research on physically-based simulation w…☆48Updated this week
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆77Updated last year
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆26Updated last week
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- A simple BVH data structure.☆16Updated 8 months ago
- ☆60Updated 7 months ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆173Updated 8 months ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 3 years ago
- Introduction to state-of-the-art simulation methods for rigid bodies, deformable solids and fluids in the area of visual computing☆51Updated 8 months ago
- Hierarchical Optimization Time Integration (HOT) for efficient implicit timestepping of the material point method (MPM)☆97Updated 4 years ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆34Updated 2 months ago
- An algorithm for Structured Volume Decomposition☆38Updated last month
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆138Updated 10 months ago
- ☆39Updated 3 years ago
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆17Updated 6 months ago
- Code for the Siggraph 2023 Paper: Shortest Path to Boundary for Self-Intersecting Meshes☆89Updated last year