Jurwen / Adaptive-grid-generationLinks
The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)
☆20Updated 11 months ago
Alternatives and similar repositories for Adaptive-grid-generation
Users that are interested in Adaptive-grid-generation are comparing it to the libraries listed below
Sorting:
- Indirect Predicates for Geometric Constructions☆47Updated 4 months ago
- 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
- ☆71Updated 2 weeks ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆27Updated 3 years ago
- ☆16Updated 8 months ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆60Updated last month
- ☆31Updated last year
- Surface Simplification using Intrinsic Error Metrics☆72Updated last year
- Toolkit for Meshing in the Wild☆162Updated last month
- ☆13Updated last year
- ☆218Updated 2 months ago
- GPU-accelerated triangle mesh processing☆268Updated this week
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆176Updated last year
- The code of paper "Robust Computation of Implicit Surface Networks for Piecewise Linear Functions" (SIGGRAPH 2022)☆14Updated 9 months ago
- Source Codes for Injective Deformation Processing (IDP) with Incremental Potential Contact (IPC)☆57Updated 2 years ago
- A light-weighted, efficient and header-only mesh processing frame work.☆52Updated 2 years ago
- Sweep and Tiniest Queue & Tight-Inclusion GPU CCD☆17Updated 2 weeks ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆145Updated 3 months ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆56Updated 11 months ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆28Updated 3 years ago
- This is a simple version including dense sovler only.☆23Updated 3 years ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆36Updated 7 months ago
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆34Updated this week
- A massively parallel high performance GPU Cosserat Rods Simulator☆42Updated last month
- This is a fast GPU SPH framework☆21Updated 2 months ago
- A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…☆27Updated 4 years ago
- General broad-phase collision detection framework using BVH and BVTT front tracking.☆79Updated 2 years ago
- An example that complies and runs the fast winding number for soups☆80Updated 6 years ago
- A library for Directional Field Synthesis, Design, and Processing.☆202Updated last month