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).
☆157Updated last year
Alternatives and similar repositories for FastAndRobustMeshArrangements
Users that are interested in FastAndRobustMeshArrangements are comparing it to the libraries listed below
Sorting:
- ☆216Updated this week
- Toolkit for Meshing in the Wild☆157Updated this week
- Indirect Predicates for Geometric Constructions☆46Updated last month
- GPU-accelerated triangle mesh processing☆261Updated this week
- The Robust Quad Mesh Extraction Library☆119Updated 4 years ago
- A library for Directional Field Synthesis, Design, and Processing.☆197Updated this week
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated 2 months ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆174Updated 10 months ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆170Updated 2 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆55Updated 9 months ago
- ☆61Updated 3 weeks ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆57Updated 3 weeks ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆104Updated last year
- This is a mirror of the latest stable version of Tetgen.☆103Updated 2 months ago
- Isotropic Remeshing of Triangulated Surface☆90Updated 2 years ago
- Fast simplification of 3D surface meshes☆328Updated last month
- This is a clone of "A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator" tetgen; Official website:☆191Updated 5 months ago
- Remesh surface using the centroidal Voronoi tessellation.☆43Updated 5 years ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆35Updated 5 months ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆143Updated last month
- An example that complies and runs the fast winding number for soups☆77Updated 6 years ago
- A light-weighted, efficient and header-only mesh processing frame work.☆52Updated 2 years ago
- Practical Feature-Preserving Block Decomposition for Strongly Hex-Dominant Meshing☆73Updated 2 years ago
- Quadrilateral-dominant and Hexahedral-dominant meshes generator☆89Updated 2 months ago
- ☆127Updated last month
- ☆154Updated last year
- http://www.hexalab.net: an online viewer for hexahedral meshes☆130Updated 11 months ago
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆135Updated last year
- A library for various continuous collision detection algorithms.☆59Updated 2 years ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year