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).
☆160Updated 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☆47Updated 2 months ago
- ☆217Updated last month
- Toolkit for Meshing in the Wild☆158Updated last week
- GPU-accelerated triangle mesh processing☆264Updated 2 weeks ago
- A library for Directional Field Synthesis, Design, and Processing.☆198Updated last week
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆55Updated 10 months ago
- The Robust Quad Mesh Extraction Library☆123Updated 4 years ago
- A light-weighted, efficient and header-only mesh processing frame work.☆52Updated 2 years ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆36Updated 6 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆57Updated 2 months ago
- ☆127Updated 2 months ago
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆19Updated 10 months ago
- TriWild: Robust Triangulation with Curve Constraints☆246Updated 2 years ago
- ☆63Updated 2 months ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆170Updated 2 years ago
- Fast simplification of 3D surface meshes☆338Updated 3 weeks ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last month
- Discrete Conformal Equivalence of Polyhedral Surfaces☆105Updated 2 years ago
- Discrete mesh offsetting based on half-space Voronoi diagrams.☆41Updated last year
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆82Updated 2 years ago
- This is a mirror of the latest stable version of Tetgen.☆104Updated 3 months ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆176Updated 11 months ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆145Updated 2 months ago
- This is a clone of "A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator" tetgen; Official website:☆196Updated 7 months ago
- An example that complies and runs the fast winding number for soups☆78Updated 6 years ago
- fast distance and ray intersection queries☆412Updated 2 weeks ago
- Isotropic Remeshing of Triangulated Surface☆91Updated 2 years ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 3 years ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- Quadrilateral-dominant and Hexahedral-dominant meshes generator☆90Updated 4 months ago