gcherchi / FastAndRobustMeshArrangementsLinks
This is the header-only version of the code we used for the experiments in the paper "Fast and Robust Mesh Arrangements using Floating-point Arithmetic" by G. Cherchi, M. Livesu, R. Scateni and M. Attene (SIGGRAPH Asia 2020).
☆166Updated last year
Alternatives and similar repositories for FastAndRobustMeshArrangements
Users that are interested in FastAndRobustMeshArrangements are comparing it to the libraries listed below
Sorting:
- Indirect Predicates for Geometric Constructions☆49Updated this week
- ☆226Updated 5 months ago
- Toolkit for Meshing in the Wild☆170Updated this week
- A library for Directional Field Synthesis, Design, and Processing.☆214Updated last week
- GPU-accelerated triangle mesh processing☆286Updated this week
- The Robust Quad Mesh Extraction Library☆127Updated 5 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆61Updated 5 months ago
- A light-weighted, efficient and header-only mesh processing frame work.☆56Updated 3 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆61Updated 2 months ago
- [SIGGRAPH'24] The code of paper "Adaptive grid generation for discretizing implicit complexes"☆20Updated last year
- ☆74Updated this week
- Discrete mesh offsetting based on half-space Voronoi diagrams.☆42Updated last year
- TriWild: Robust Triangulation with Curve Constraints☆254Updated 3 years ago
- This is a mirror of the latest stable version of Tetgen.☆105Updated 8 months ago
- ☆130Updated 7 months ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆86Updated 2 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆57Updated last year
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆173Updated 2 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆176Updated last week
- Practical Feature-Preserving Block Decomposition for Strongly Hex-Dominant Meshing☆79Updated 2 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆147Updated 7 months ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆36Updated last week
- This is a clone of "A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator" tetgen; Official website:☆204Updated 11 months ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆109Updated 2 years ago
- Fast simplification of 3D surface meshes☆366Updated 3 weeks ago
- An example that complies and runs the fast winding number for soups☆82Updated 7 years ago
- C++ library for fast computation of neighbor lists in point clouds.☆55Updated last week
- fast distance and ray intersection queries☆445Updated last month
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- A Constrained Resampling Strategy for Mesh Improvement - SGP 2017☆58Updated 3 years ago