• CGAL

  • Referenced in 244 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 229 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...
  • Qhull

  • Referenced in 200 articles [sw04419]
  • hulls.Qhull may be used for the Delaunay triangulation or the Voronoi diagram...
  • DistMesh

  • Referenced in 129 articles [sw12766]
  • choice of meshpoints (vertex nodes) and a triangulation. We want to offer a short...
  • Hull

  • Referenced in 68 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...
  • LOLIB

  • Referenced in 79 articles [sw12655]
  • occurs in economics as the so-called Triangulation Problem for Input-Output Matrices. Our data...
  • Normaliz

  • Referenced in 77 articles [sw00630]
  • hyperplanes, and vice versa), convex hulls, a triangulation of a vector, the Hilbert basis...
  • TOPCOM

  • Referenced in 44 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 64 articles [sw10593]
  • reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. VTK has an extensive information visualization framework...
  • 2D triangulations

  • Referenced in 29 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...
  • plantri

  • Referenced in 37 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...
  • Voronoi

  • Referenced in 58 articles [sw21795]
  • compute 2d Voronoi diagrams and Delaunay triangulations. voronoi.tar (Others have fixed memory leaks and improved...
  • STRIPACK

  • Referenced in 20 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 23 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 21 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 17 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 13 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 15 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...
  • MONACO

  • Referenced in 21 articles [sw20793]
  • diverging channel using an adapted unstructured triangulated grid, a flow around a planetary probe...
  • Algorithm 792

  • Referenced in 20 articles [sw04774]
  • algorithms. The algorithms include seven triangulation-based methods and three modified Shepard methods...