tatsy / tinymesh
TinyMesh is a light-weight mesh processing library in C/C++.
☆96Updated last year
Alternatives and similar repositories for tinymesh:
Users that are interested in tinymesh are comparing it to the libraries listed below
- Dual Marching Cubes Implementation in C++☆64Updated 4 years ago
- Indirect Predicates for Geometric Constructions☆45Updated 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…☆153Updated 11 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆55Updated last year
- A public domain/MIT header-only marching cube implementation in C++ without anything fancy.☆41Updated last year
- A light-weighted, efficient and header-only mesh processing frame work.☆51Updated 2 years ago
- A collection of common mesh subdivision algorithms☆94Updated 7 years ago
- A fast and easy-to-use PLY parsing library in a single c++11 header and cpp file☆66Updated 2 years ago
- Isotropic Remeshing of Triangulated Surface☆87Updated 2 years ago
- Acceleration structure library (BVH-, KD-Tree) with basic parallel construction☆53Updated 6 years ago
- This is a mirror of the latest stable version of Tetgen.☆97Updated 2 years ago
- Toolkit for Meshing in the Wild☆140Updated 2 weeks ago
- The Robust Quad Mesh Extraction Library☆114Updated 4 years ago
- An example that complies and runs the fast winding number for soups☆71Updated 6 years ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆103Updated last year
- ☆15Updated 7 years ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 2 years ago
- A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.☆116Updated 13 years ago
- Closed 3D Triangle Mesh Boolean Operation Library☆25Updated 3 years ago
- an elegant, high-performance and user-friendly halfedge data structure☆82Updated 4 years ago
- An algorithm for Structured Volume Decomposition☆36Updated last week
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 3 years ago
- Signed Distance Function from triangle mesh.☆92Updated 5 years ago
- Robust, efficient and low distortion bijective mapping in 2D and 3D☆59Updated 3 years ago
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- ☆31Updated 2 years ago
- ☆58Updated 7 months ago
- The ultimate mesh handling library☆55Updated 3 months ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆56Updated last year
- Guaranteed-robust intrinsic triangulations for surface mesh processing! (C++ demo app)☆28Updated last year