yig / halfedge
A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.
☆116Updated 13 years ago
Alternatives and similar repositories for halfedge:
Users that are interested in halfedge are comparing it to the libraries listed below
- Dual Marching Cubes Implementation in C++☆64Updated 4 years ago
- The Robust Quad Mesh Extraction Library☆111Updated 4 years ago
- Isosurface extraction from regular voxel grids☆79Updated 7 years ago
- A collection of common mesh subdivision algorithms☆94Updated 6 years ago
- Acceleration structure library (BVH-, KD-Tree) with basic parallel construction☆53Updated 6 years ago
- ☆126Updated 2 months ago
- A light-weighted, efficient and header-only mesh processing frame work.☆50Updated 2 years ago
- Indirect Predicates for Geometric Constructions☆45Updated last week
- A simple feature-preserving isotropic remesher based on edge flips, edge collapses and vertex repositioning☆51Updated 6 months ago
- ☆15Updated 7 years ago
- A simple, easily hackable C++ surface voxelizer (STL=>voxels)☆174Updated 3 years ago
- Directional Field Synthesis, Design, and Processing☆82Updated 3 years ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆174Updated 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…☆153Updated 9 months ago
- Dual Contouring Implementation in C++, by Tao Ju, from http://sourceforge.net/projects/dualcontouring/☆67Updated 10 years ago
- Bounding Proxies for Shape Approximation (SIGGRAPH 2017) - Reference Implementation☆71Updated 5 years ago
- TinyMesh is a light-weight mesh processing library in C/C++.☆94Updated last year
- A C++ library to compute neighborhood information for point clouds within a fixed radius. Suitable for many applications, e.g. neighborho…☆161Updated 10 months ago
- Code for fast approximate generalized winding number (solid angle) computation for triangle soups☆133Updated 3 years ago
- ☆201Updated this week
- an elegant, high-performance and user-friendly halfedge data structure☆82Updated 4 years ago
- Computes the 3D Delaunay triangulation on the GPU☆126Updated 3 years ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆78Updated last year
- Robust, efficient and low distortion bijective mapping in 2D and 3D☆59Updated 3 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆148Updated 6 years ago
- Implementation for "Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring"☆53Updated 9 years ago
- Corresponding Code for the SIGGRAPH Asia paper "Nested Cages"☆82Updated last year
- HPMC is a small OpenGL/C/C++-library that extractes iso-surfaces of volumetric data directly on the GPU.☆21Updated 10 years ago
- OpenGP☆81Updated 2 years ago
- A visualization and editing tool for reflectance data☆133Updated 5 years ago