vilya / miniplyLinks
A fast and easy-to-use PLY parsing library in a single c++11 header and cpp file
☆83Updated 2 years ago
Alternatives and similar repositories for miniply
Users that are interested in miniply are comparing it to the libraries listed below
Sorting:
- TinyMesh is a light-weight mesh processing library in C/C++.☆97Updated last year
- A C++ geometry processing library☆52Updated 4 years ago
- Dual Marching Cubes Implementation in C++☆64Updated 5 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆60Updated 3 months ago
- Acceleration structure library (BVH-, KD-Tree) with basic parallel construction☆56Updated 6 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…☆165Updated last year
- Single file, header-only, no-dependencies C library for Poisson disk sampling in arbitrary dimensions.☆120Updated 9 months ago
- A light-weighted, efficient and header-only mesh processing frame work.☆55Updated 3 years ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- A Constrained Resampling Strategy for Mesh Improvement - SGP 2017☆58Updated 3 years ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆179Updated 7 years ago
- Single-file, header-only, no dependencies C++ implementation of the Wavefront obj file format.☆24Updated last year
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆56Updated last year
- Indirect Predicates for Geometric Constructions☆47Updated 5 months ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆60Updated this week
- A public domain/MIT header-only marching cube implementation in C++ without anything fancy.☆47Updated 2 years ago
- A collection of common mesh subdivision algorithms☆98Updated 7 years ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- Guaranteed-robust intrinsic triangulations for surface mesh processing! (C++ demo app)☆30Updated 2 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆173Updated 7 years ago
- Isosurface extraction from regular voxel grids☆81Updated 8 years ago
- Isotropic Remeshing of Triangulated Surface☆92Updated 2 years ago
- A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.☆61Updated 8 months ago
- Signed Distance Function from triangle mesh.☆94Updated 6 years ago
- Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.☆107Updated 2 years ago
- Git mirror of the geogram library by INRIA☆131Updated 3 years ago
- Robust geometric predicates☆62Updated last year
- A nano spline library in modern C++.☆128Updated last year
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆174Updated 2 years ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆107Updated 2 years ago