dcoeurjo / GeometryProcessing-cmake-recipesLinks
CPM / cmake recipes for geometry processing stuff
☆20Updated 2 months ago
Alternatives and similar repositories for GeometryProcessing-cmake-recipes
Users that are interested in GeometryProcessing-cmake-recipes are comparing it to the libraries listed below
Sorting:
- ☆77Updated last month
- This is the header-only version of the code we used for the experiments in the paper "Fast and Robust Mesh Arrangements using Floating-po…☆168Updated last year
- Indirect Predicates for Geometric Constructions☆50Updated last month
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆39Updated 3 months ago
- ☆31Updated last year
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 4 years ago
- A repository with a variety of meshes with minimal licensing requirements.☆250Updated last year
- Toolkit for Meshing in the Wild☆175Updated this week
- ☆130Updated 8 months ago
- A library for Directional Field Synthesis, Design, and Processing.☆217Updated last month
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆61Updated 7 months 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
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- The Robust Quad Mesh Extraction Library☆130Updated 5 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆58Updated last year
- Convex Polyhedral Meshing for Robust Solid Modeling☆62Updated last month
- fast distance and ray intersection queries☆451Updated this week
- Code for fast approximate generalized winding number (solid angle) computation for triangle soups☆16Updated 3 years ago
- An example that complies and runs the fast winding number for soups☆82Updated 7 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆87Updated 2 years ago
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆148Updated 2 years ago
- GPU-accelerated triangle mesh processing☆291Updated last week
- Discrete mesh offsetting based on half-space Voronoi diagrams.☆42Updated 2 years ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆27Updated 3 years ago
- Automatic Differentiation in Geometry Processing Made Simple☆424Updated 3 months ago
- Author's implementation of SIGGRAPH 2023 paper, "A Practical Walk-on-Boundary Method for Boundary Value Problems."☆56Updated 7 months ago
- Exact and approximate solvers for minimum-cost-flow problems in bi-directed graphs.☆36Updated 3 weeks ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆176Updated 2 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆180Updated 2 months ago
- Fork of https://sourceforge.net/projects/imatistl/☆17Updated 7 years ago