ashwin / gDel3DLinks
gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
☆159Updated 6 years ago
Alternatives and similar repositories for gDel3D
Users that are interested in gDel3D are comparing it to the libraries listed below
Sorting:
- Computes the 3D Delaunay triangulation on the GPU☆128Updated 3 years ago
- Git mirror of the geogram library by INRIA☆129Updated 2 years ago
- Isosurface extraction from regular voxel grids☆78Updated 7 years ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆178Updated 7 years ago
- C++ library and set of utilities for input, output, and basic manipulation of 3D triangle meshes☆325Updated last year
- 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…☆154Updated last year
- The Robust Quad Mesh Extraction Library☆119Updated 4 years ago
- A C++ half-edge data structure for a triangle mesh with no external dependencies whatsoever. Public domain.☆116Updated 13 years ago
- A Constrained Resampling Strategy for Mesh Improvement - SGP 2017☆57Updated 3 years ago
- Indirect Predicates for Geometric Constructions☆46Updated 3 weeks ago
- This is a clone of "A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator" tetgen; Official website:☆187Updated 5 months ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆81Updated last year
- Least squares conformal mapping implemented in C++☆114Updated 4 years ago
- Shape Spherical Harmonics (Descriptors, Alignment, and Symmetry)☆75Updated 5 years ago
- Curvature assignment for Geometry Processing course☆156Updated 2 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last month
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated 11 months ago
- Toolkit for Meshing in the Wild☆154Updated this week
- delaunay triangulation in 3D space, to reconstruct convex hull from spherical dot cloud☆76Updated 6 years ago
- Directional Field Synthesis, Design, and Processing☆82Updated 3 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆54Updated 8 months ago
- ☆75Updated 10 years ago
- geometry processing and shape analysis framework☆67Updated 2 months ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆168Updated 2 years ago
- Signed Distance Function from triangle mesh.☆93Updated 6 years ago
- Dual Marching Cubes Implementation in C++☆65Updated 4 years ago
- Offers several algorithms to triangulate 3d scattered points☆46Updated 4 years ago
- This is a mirror of the latest stable version of Triangle.☆139Updated last month
- Robust, efficient and low distortion bijective mapping in 2D and 3D☆60Updated 3 years ago
- Simple C++ implementation of the (manifold) dual marching cubes algorithm from Gregory M. Nielson☆174Updated 5 years ago