chitalu / oibvh-tree
Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"
☆31Updated 4 years ago
Alternatives and similar repositories for oibvh-tree
Users that are interested in oibvh-tree are comparing it to the libraries listed below
Sorting:
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆77Updated last year
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 2 years ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆17Updated last month
- A high performance and friendly GPU LBVH implementation.☆23Updated last month
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆26Updated last month
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- ☆39Updated 3 years ago
- ☆21Updated 3 years ago
- A library for various continuous collision detection algorithms.☆59Updated 2 years ago
- Fast CUDA 3x3 SVD☆72Updated 6 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆55Updated last year
- ☆55Updated 5 years ago
- ☆51Updated last year
- ☆20Updated 4 years ago
- C++ library for fast computation of neighbor lists in point clouds.☆57Updated 5 months ago
- Gradients/Hessians for optimizing with rotation variables.☆26Updated 2 years ago
- A simple BVH data structure.☆16Updated 9 months ago
- Signed Distance Function from triangle mesh.☆93Updated 6 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆139Updated 11 months ago
- Implementation for "Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring"☆56Updated 9 years ago
- Indirect Predicates for Geometric Constructions☆45Updated last week
- 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
- ☆21Updated last year
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆53Updated 7 months ago
- ☆29Updated 11 months ago
- ☆31Updated last year
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆17Updated 7 months ago
- A light-weighted, efficient and header-only mesh processing frame work.☆52Updated 2 years ago
- The code of paper "Robust Computation of Implicit Surface Networks for Piecewise Linear Functions" (SIGGRAPH 2022)☆14Updated 5 months ago