dominikwodniok / dualmcLinks
Simple C++ implementation of the (manifold) dual marching cubes algorithm from Gregory M. Nielson
☆178Updated 6 years ago
Alternatives and similar repositories for dualmc
Users that are interested in dualmc are comparing it to the libraries listed below
Sorting:
- Dual Contoruing implemented in C++☆98Updated 6 years ago
- Single file, header-only, no-dependencies C library for Poisson disk sampling in arbitrary dimensions.☆119Updated 8 months ago
- Out-Of-Core Construction of Sparse Voxel Octrees - reference implementation☆285Updated 2 years ago
- Dual Contouring Implementation in C++, by Tao Ju, from http://sourceforge.net/projects/dualcontouring/☆69Updated 11 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…☆306Updated 2 years ago
- Dual Marching Cubes Implementation in C++☆64Updated 5 years ago
- Computer Graphics Assignment about Bounding Volume Hierarchies☆131Updated 3 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆56Updated last year
- A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.☆117Updated 13 years ago
- A GPU implementation of the Marching Cubes algorithm for extracting surfaces from volumes using OpenCL and OpenGL☆195Updated 8 years ago
- A simple, easily hackable C++ surface voxelizer (STL=>voxels)☆179Updated 4 years ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆179Updated 7 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…☆164Updated last year
- Demonstration code for Marching Cubes and Dual Contouring☆307Updated 2 years ago
- The Robust Quad Mesh Extraction Library☆125Updated 5 years ago
- Fast (er) implementation of dual contouring which avoids the octree☆166Updated 8 years ago
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆169Updated 3 weeks ago
- Isosurface extraction from regular voxel grids☆81Updated 8 years ago
- C++ library and set of utilities for input, output, and basic manipulation of 3D triangle meshes☆330Updated 2 years ago
- A collection of common mesh subdivision algorithms☆98Updated 7 years ago
- An implementation of the Dual Contouring algorithm based on the reference code☆170Updated 9 years ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆105Updated 2 years ago
- Implementation of the bounding mesh and bounding convex decomposition algorithms for single-sided mesh approximation☆346Updated 4 years ago
- Computes the 3D Delaunay triangulation on the GPU☆131Updated 4 years ago
- A library for Directional Field Synthesis, Design, and Processing.☆205Updated this week
- ☆128Updated 4 months ago
- Code for fast approximate generalized winding number (solid angle) computation for triangle soups☆142Updated 4 years ago
- ☆15Updated 7 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆172Updated 7 years ago
- Fast singular value decomposition, diagonalization, QR decomposition of 3x3 matrices.☆160Updated 3 years ago