gDel3D

3D Triangulator

A GPU-accelerated algorithm for computing the Delaunay triangulation of 3D point sets

gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.

GitHub

147 stars
5 watching
34 forks
Language: C++
last commit: over 6 years ago
Linked from 1 awesome list


Backlinks from these awesome lists:

Related projects:

Repository Description Stars
hiulit/delaunator-gdscript A fast algorithm for triangulating 2D points into Delaunay triangles 81
artem-ogre/cdt A C++ library for generating constrained or conforming Delaunay triangulations with robust and efficient algorithms 1,099
soerendd/delaunator-cpp A fast C++ library for Delaunay triangulation of 2D points 0
acheul/louvre An algorithm for decomposing polygons into triangles, specifically designed to handle self-intersecting shapes. 3
pemn/vtk_triangulate_points Creates simplified surfaces from dense point clouds using either Delaunay or grid triangulation methods 10
hugoledoux/startin A software library for computing Delaunay triangulations of 2.5D points with elevation data 34
open-s2/earclip Fast triangulation of polygons 5
mourner/delaunator-rs A fast and robust Rust library for Delaunay triangulation of 2D points 211
tchayen/triangolatte A library for 2D triangulation of polygons and lines with support for GPU translation 36
mapbox/earcut.hpp A fast and efficient polygon triangulation algorithm with support for complex shapes and holes 871
fil/d3-geo-voronoi Computes spherical Delaunay triangulation and Voronoi diagrams from 3D point data 239
dengwirda/jigsaw-matlab Provides MATLAB bindings for generating high-quality triangulations and polyhedral decompositions of general planar, surface, and volumetric domains. 75
appelmar/gdalcubes An R package for working with satellite imagery data as regular raster data cubes 122
graphdeco-inria/diff-gaussian-rasterization A Cuda implementation of differential Gaussian rasterization for fast rendering of radiance fields 945
yonaba/delaunay A Lua module for computing Delaunay triangulations of convex polygons 108