2D Delaunay triangulation C++17 library using Bowyer-Watson
-
Updated
Jan 1, 2024 - C++
2D Delaunay triangulation C++17 library using Bowyer-Watson
VoronoiX (or VX) - C++ library, with JS interface on top of it, that allows to work with different data structures and algorithms related to Voronoi diagram, Delaunay triangulation and other geometric structures.
2D constrained Delaunay triangulation library
Contains the codes and reports that were done as a part of the ED5310: Algorithms in Computational Geometry
A collection of math utilities for 2D lines, bezier curves and arrangements made of them (WIP)
Delaunay Triangulation using Randomized Incremental Algorithm.
Algorithm for triangulation, c++, SDL2
Convert a 3D Closed Surface Mesh into Raster 3D Image Data using ITK & VTK
Project for 3D Geometry Reconstruction based on the open-source project - Easy3D.
Enumerate all convex polygons' triangulations
Line detection from images, object clustering and point cloud triangulation
2D triangulation
2D computational geometry
Code to perform a triangulation based on Sperner's Lemma
Triangulate planar non-complex polygons in 3D space
Calculating the area of planar non-complex polygons in 3D space
Paper Reproduction: Image Representation on Curved Optimal Triangulation
Add a description, image, and links to the triangulation topic page so that developers can more easily learn about it.
To associate your repository with the triangulation topic, visit your repo's landing page and select "manage topics."