• Triangle

  • Referenced in 328 articles [sw07890]
  • Triangulator. Triangle generates exact Delaunay triangulations, constrained Delaunay triangulations, conforming Delaunay triangulations, Voronoi diagrams...
  • CGAL

  • Referenced in 334 articles [sw00118]
  • algorithms like triangulations (2D constrained triangulations and Delaunay triangulations in 2D and 3D, periodic triangulations...
  • TetGen

  • Referenced in 83 articles [sw04046]
  • incremental Delaunay algorithms for inserting vertices, constrained Delaunay algorithms for inserting constraints (edges and triangles ... recovering constraints, and a new constrained Delaunay refinement algorithm for adaptive quality tetrahedral mesh generation...
  • 2D triangulations

  • Referenced in 35 articles [sw11159]
  • also provided for sets of weighted points. Delaunay and regular triangulations offer nearest neighbor queries ... power diagrams. Finally, constrained and Delaunay constrained triangulations allows to force some constrained segments ... triangulation. Several versions of constrained and Delaunay constrained triangulations are provided: some of them handle...
  • GTS

  • Referenced in 20 articles [sw05359]
  • volume, curvature, etc.), 2D Delaunay and constrained Delaunay triangulations, robust geometric predicates and set operations...
  • TRIPACK

  • Referenced in 15 articles [sw00978]
  • Algorithm 751: TRIPACK: A constrained two-dimensional Delaunay triangulation package. TRIPACK is a Fortran ... incremental algorithn to construct a constrained Delaunay triangulation of a set of points...
  • EasyMesh

  • Referenced in 13 articles [sw13276]
  • Generates two dimensional, unstructured, Delaunay and constrained Delaunay triangulations in general domains. Handles holes...
  • geometry

  • Referenced in 13 articles [sw10010]
  • about a point, Voronoi diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams ... convex hull. Qhull does not support constrained Delaunay triangulations, or mesh generation of non-convex...
  • H-Morph

  • Referenced in 11 articles [sw08564]
  • similar to those used in boundary constrained Delaunay mesh generation are used. Tetrahedra internal...
  • Algorithm 872

  • Referenced in 4 articles [sw12991]
  • Algorithm 872: Parallel 2D constrained Delaunay mesh generation. Delaunay refinement is a widely used method ... software for the parallel constrained Delaunay mesh generation in two dimensions. Our approach is based...
  • TRIOPT

  • Referenced in 6 articles [sw02486]
  • bound-constrained black box global optimization problems. The method starts by forming a Delaunay triangulation...
  • tripack

  • Referenced in 1 article [sw25291]
  • Irregularly Spaced Data. A constrained two-dimensional Delaunay triangulation package providing both triangulation and generation...
  • Delynoi

  • Referenced in 2 articles [sw30670]
  • meshes on arbitrary domains, based on the constrained Voronoi diagram. It is the built ... meshes, the library first computes the conforming Delaunay triangulation using Triangle; the triangulation is considered ... needed. Then, it computes the constrained Voronoi diagram...
  • cdd

  • Referenced in 107 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • Gmsh

  • Referenced in 528 articles [sw00366]
  • Gmsh is a 3D finite element grid generator...
  • LAPACK

  • Referenced in 1582 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LEDA

  • Referenced in 258 articles [sw00509]
  • In the core computer science areas -- data structures...
  • Maple

  • Referenced in 4896 articles [sw00545]
  • The result of over 30 years of cutting...
  • Matlab

  • Referenced in 11446 articles [sw00558]
  • MATLAB® is a high-level language and interactive...