Samson-Mano / Delaunay-triangulation
This is a C# implementation of Divide and conquer Delaunay triangulation. The implementation follows Guibas and Stolfi’s paper. This is the vertical cut implementation of divide and conquer.
☆23Updated last year
Alternatives and similar repositories for Delaunay-triangulation:
Users that are interested in Delaunay-triangulation are comparing it to the libraries listed below
- Constrained Delaunay Triangulation (CDT) of a random surface domain.☆41Updated 2 years ago
- C++ wrapper for the original J.P Shevchuk's "Triangle" package☆37Updated 5 months ago
- CMake project for Jonathan Shewchuk's Triangle mesh generator.☆66Updated 6 years ago
- A simple two-dimensional mesh generator with triangular and quadrilateral elements in C++☆72Updated last month
- Cut a tetrahedral mesh with a triangle mesh in 3D.☆82Updated 4 years ago
- This is a mirror of the latest stable version of Tetgen.☆97Updated 2 years ago
- This is a clone of "A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator" tetgen; Official website:☆181Updated 2 months ago
- Indirect Predicates for Geometric Constructions☆45Updated last month
- Geometric data structures and algorithms for computational design tasks☆119Updated 3 years ago
- straight skeleton code implementing Aichholzer and Aurenhammer's Triangulation based algorithm☆21Updated 4 years ago
- http://www.hexalab.net: an online viewer for hexahedral meshes☆123Updated 7 months ago
- ☆206Updated last week
- C# library for 2D/3D geometric computation, mesh algorithms, and so on. Boost license.☆236Updated last year
- Toolkit for Meshing in the Wild☆140Updated 2 weeks ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆80Updated last year
- TriWild: Robust Triangulation with Curve Constraints☆240Updated 2 years ago
- C# wrapper for CGAL☆223Updated 10 months ago
- A Two-Dimensional Quality Mesh Generator and Delaunay Triangulator by Jonathan Richard Shewchuk☆34Updated 4 years ago
- Compute centroidal Voronoi tessellations in 2D and 3D using the GPU.☆39Updated 5 years ago
- Fearless Boolean operations on triangle meshes 🛌💤☆34Updated 3 months ago
- Robust geometric predicates☆58Updated 8 months ago
- The Robust Quad Mesh Extraction Library☆114Updated 4 years ago
- A single-header C++ library of angle-based flattening algorithms (mirror repository)☆50Updated last year
- GoTools Geometry Toolkit☆70Updated 3 months ago
- A .Net fast convex hull library for 2, 3, and higher dimensions.☆350Updated 3 years ago
- 3D Constrained Delaunay Refinement on the GPU☆10Updated 4 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 11 months ago
- An automatic Voxelization/Octree based Hexahedral Mesh Generation☆65Updated 3 years ago
- Parallel implementation of Guibas & Stolfi's divide-and-conquer algorithm for Delaunay triangulation, using MPI in Python.☆14Updated last year
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆151Updated 6 years ago