vilya / miniplyLinks
A fast and easy-to-use PLY parsing library in a single c++11 header and cpp file
☆78Updated 2 years ago
Alternatives and similar repositories for miniply
Users that are interested in miniply are comparing it to the libraries listed below
Sorting:
- Dual Marching Cubes Implementation in C++☆65Updated 4 years ago
- Single file, header-only, no-dependencies C library for Poisson disk sampling in arbitrary dimensions.☆119Updated 5 months ago
- TinyMesh is a light-weight mesh processing library in C/C++.☆96Updated last year
- A Constrained Resampling Strategy for Mesh Improvement - SGP 2017☆57Updated 3 years ago
- Acceleration structure library (BVH-, KD-Tree) with basic parallel construction☆55Updated 6 years ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆180Updated 7 years ago
- A C++ geometry processing library☆50Updated 4 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆55Updated 9 months ago
- Isotropic Remeshing of Triangulated Surface☆90Updated 2 years ago
- 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…☆160Updated last year
- Indirect Predicates for Geometric Constructions☆47Updated 2 months ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last week
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆162Updated 6 years ago
- Git mirror of the geogram library by INRIA☆131Updated 2 years ago
- A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.☆61Updated 4 months ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- A public domain/MIT header-only marching cube implementation in C++ without anything fancy.☆42Updated last year
- A light-weighted, efficient and header-only mesh processing frame work.☆52Updated 2 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆57Updated last month
- A collection of common mesh subdivision algorithms☆98Updated 7 years ago
- A nano spline library in modern C++.☆121Updated 8 months ago
- The Robust Quad Mesh Extraction Library☆120Updated 4 years ago
- Signed Distance Function from triangle mesh.☆93Updated 6 years ago
- Isosurface extraction from regular voxel grids☆80Updated 7 years ago
- Robust, efficient and low distortion bijective mapping in 2D and 3D☆61Updated 4 years ago
- UGU: Unclearness Geometry Utility☆40Updated 2 weeks ago
- A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.☆117Updated 13 years ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆170Updated 2 years ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- Code for fast approximate generalized winding number (solid angle) computation for triangle soups☆139Updated 3 years ago