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).
☆154Updated last year
Alternatives and similar repositories for FastAndRobustMeshArrangements
Users that are interested in FastAndRobustMeshArrangements are comparing it to the libraries listed below
Sorting:
- ☆214Updated last week
- Indirect Predicates for Geometric Constructions☆46Updated 3 weeks ago
- Toolkit for Meshing in the Wild☆154Updated last week
- GPU-accelerated triangle mesh processing☆259Updated this week
- A library for Directional Field Synthesis, Design, and Processing.☆196Updated 3 months ago
- The Robust Quad Mesh Extraction Library☆119Updated 4 years ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆103Updated last year
- Convex Polyhedral Meshing for Robust Solid Modeling☆56Updated this week
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last month
- This is a mirror of the latest stable version of Tetgen.☆102Updated last month
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆173Updated 9 months ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆168Updated 2 years ago
- An example that complies and runs the fast winding number for soups☆76Updated 6 years ago
- A light-weighted, efficient and header-only mesh processing frame work.☆52Updated 2 years ago
- ☆61Updated this week
- A single-header C++ library of angle-based flattening algorithms (mirror repository)☆49Updated last year
- Practical Feature-Preserving Block Decomposition for Strongly Hex-Dominant Meshing☆72Updated 2 years ago
- Isotropic Remeshing of Triangulated Surface☆89Updated 2 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆142Updated last week
- Isosurface extraction from regular voxel grids☆78Updated 7 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆81Updated last year
- an elegant, high-performance and user-friendly halfedge data structure☆83Updated 4 years ago
- Discrete mesh offsetting based on half-space Voronoi diagrams.☆41Updated last year
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆54Updated 8 months ago
- ☆154Updated last year
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆17Updated 8 months ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆34Updated 4 months ago
- TriWild: Robust Triangulation with Curve Constraints☆243Updated 2 years ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated 11 months ago
- Quadrilateral-dominant and Hexahedral-dominant meshes generator☆89Updated 2 months ago