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:
- Toolkit for Meshing in the Wild☆162Updated last month
- Indirect Predicates for Geometric Constructions☆47Updated 4 months ago
- ☆218Updated 2 months ago
- A library for Directional Field Synthesis, Design, and Processing.☆202Updated last month
- GPU-accelerated triangle mesh processing☆268Updated this week
- The Robust Quad Mesh Extraction Library☆124Updated 5 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆56Updated 11 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆60Updated last month
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆20Updated 11 months ago
- TriWild: Robust Triangulation with Curve Constraints☆248Updated 2 years ago
- ☆71Updated 2 weeks ago
- ☆128Updated 3 months ago
- 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☆176Updated last year
- This is a mirror of the latest stable version of Tetgen.☆104Updated 4 months ago
- A light-weighted, efficient and header-only mesh processing frame work.☆52Updated 2 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆83Updated 2 years ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆36Updated 7 months ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆105Updated 2 years ago
- Discrete mesh offsetting based on half-space Voronoi diagrams.☆41Updated last year
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆145Updated 3 months ago
- fast distance and ray intersection queries☆423Updated this week
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆171Updated 2 years ago
- This is a clone of "A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator" tetgen; Official website:☆202Updated 8 months ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆27Updated 3 years ago
- A static C++ library for the generation of discrete functions on a box-shaped domain. This is especially suited for the discretization of…☆304Updated 2 years ago
- Fast simplification of 3D surface meshes☆343Updated 3 weeks ago
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆168Updated 2 months ago
- A simple, easily hackable C++ surface voxelizer (STL=>voxels)☆179Updated 4 years 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