• # CGAL

• Referenced in 305 articles [sw00118]
• CGAL), offers data structures and algorithms like triangulations (2D constrained triangulations and Delaunay triangulations ... periodic triangulations in 3D), Voronoi diagrams (for 2D and 3D points, 2D additively weighted Voronoi...
• # Triangle

• Referenced in 290 articles [sw07890]
• Dimensional Quality Mesh Generator and Delaunay Triangulator. Triangle generates exact Delaunay triangulations, constrained Delaunay triangulations ... conforming Delaunay triangulations, Voronoi diagrams, and high-quality triangular meshes. The latter can be generated...
• # Hull

• Referenced in 71 articles [sw11670]
• this is enforced by tiebreaking, giving a triangulation of a facet by ”placing”.) The program ... also compute Delaunay triangulations and alpha shapes, and volumes of Voronoi regions. The program uses ... factor of 2 or 3 for Delaunay triangulation, less for convex hulls). Output in postscript...
• # TOPCOM

• Referenced in 53 articles [sw04867]
• TOPCOM: Triangulations of point configurations and oriented matroids. TOPCOM is a package for computing triangulations ... chirotope, components of the flip graph of triangulations, enumerate all triangulations. The core algorithms implemented...
• # VTK

• Referenced in 83 articles [sw10593]
• reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. VTK has an extensive information visualization framework...
• # plantri

• Referenced in 50 articles [sw10864]
• many classes of planar graphs, including triangulations, quadrangulations and convex polytopes. Many applications ... compiled using Plantri are given. These include triangulations, quadrangulations, convex polytopes, several classes of cubic ... quartic graphs and triangulations of disks...
• # 2D triangulations

• Referenced in 33 articles [sw11159]
• triangulations. CGAL User and Reference Manual: This package allows to build and handle various triangulations ... point sets two dimensions. Any CGAL triangulation covers the convex hull of its vertices. Triangulations ... point location facilities. The package provides plain triangulation (whose faces depend on the insertion order ... vertices) and Delaunay triangulations. Regular triangulations are also provided for sets of weighted points. Delaunay...
• # STRIPACK

• Referenced in 26 articles [sw00921]
• Algorithm 772: STRIPACK: Delaunay triangulation and Voronoi diagram on the surface of a sphere. STRIPACK ... incremental algorithm to construct a Delaunay triangulation and, optionally, a Voronoi diagram ... surface of the unit sphere. The triangulation covers the convex hull of the nodes, which ... including an efficient means of updating the triangulation with nodal additions or deletions...
• # Regina

• Referenced in 28 articles [sw04862]
• software package for studying 3-manifold triangulations and normal surfaces. It includes a graphical user ... angle structures, census enumeration, combinatorial recognition of triangulations, and high-level functions such...
• # Q-Morph

• Referenced in 26 articles [sw08563]
• bounded three-dimensional surfaces. After first triangulating the surface, the triangles are systematically transformed ... formed by using existing edges in the triangulation, by inserting additional nodes, or by performing...
• # DeWall

• Referenced in 18 articles [sw01745]
• DeWall: a fast divide and conquer Delaunay triangulation algorithm in $E^d$. The paper deals ... with Delaunay Triangulations (DT) in E d space. This classic computational geometry problem is studied ... generality: it can be simply extended to triangulate point sets in any dimension. The technique...
• # TRIPACK

• Referenced in 14 articles [sw00978]
• TRIPACK: A constrained two-dimensional Delaunay triangulation package. TRIPACK is a Fortran 77 software package ... incremental algorithn to construct a constrained Delaunay triangulation of a set of points ... plane (nodes). The triangulation covers the convex hull of the nodes but may include polygonal ... from those in the remainder of the triangulation. This effectively allows for a nonconvex...
• # GTS

• Referenced in 16 articles [sw05359]
• Triangulated Surface Library (GTS) provides a set of useful functions to deal with 3D surfaces ... curvature, etc.), 2D Delaunay and constrained Delaunay triangulations, robust geometric predicates and set operations...