• Triangle

  • Referenced in 328 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...
  • CGAL

  • Referenced in 334 articles [sw00118]
  • algorithms like triangulations (2D constrained triangulations and Delaunay triangulations in 2D and 3D, periodic triangulations ... envelopes, Minkowski sums), mesh generation (2D Delaunay mesh generation and 3D surface and volume mesh...
  • Qhull

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

  • Referenced in 230 articles [sw12766]
  • relations) and reset the topology by the Delaunay algorithm. The geometry is described implicitly...
  • TetGen

  • Referenced in 83 articles [sw04046]
  • TetGen, a Delaunay-Based Quality Tetrahedral Mesh Generator. TetGen is a C++ program for generating ... many theoretical and practical issues. TetGen uses Delaunay-based algorithms which have theoretical guarantee ... geometric predicates. The essential algorithms include incremental Delaunay algorithms for inserting vertices, constrained Delaunay algorithms ... recovering constraints, and a new constrained Delaunay refinement algorithm for adaptive quality tetrahedral mesh generation...
  • Hull

  • Referenced in 74 articles [sw11670]
  • placing”.) The program can also compute Delaunay triangulations and alpha shapes, and volumes of Voronoi ... factor of 2 or 3 for Delaunay triangulation, less for convex hulls). Output in postscript...
  • VTK

  • Referenced in 94 articles [sw10593]
  • polygon reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. VTK has an extensive information visualization...
  • Voronoi

  • Referenced in 76 articles [sw21795]
  • program to compute 2d Voronoi diagrams and Delaunay triangulations. voronoi.tar (Others have fixed memory leaks...
  • 2D triangulations

  • Referenced in 35 articles [sw11159]
  • insertion order of the vertices) and Delaunay triangulations. Regular triangulations are also provided for sets ... weighted points. Delaunay and regular triangulations offer nearest neighbor queries and primitives to build ... Voronoi and power diagrams. Finally, constrained and Delaunay constrained triangulations allows to force some constrained ... triangulation. Several versions of constrained and Delaunay constrained triangulations are provided: some of them handle...
  • BL2D-V2

  • Referenced in 31 articles [sw10378]
  • meshing method is of controled Delaunay type, isotropic or anisotropic. The internal point generation follows ... connection is realised as in a classical Delaunay approach. Quadrilaterals are obtained by a pairing...
  • STRIPACK

  • Referenced in 27 articles [sw00921]
  • Algorithm 772: STRIPACK: Delaunay triangulation and Voronoi diagram on the surface of a sphere. STRIPACK ... employs an incremental algorithm to construct a Delaunay triangulation and, optionally, a Voronoi diagram...
  • GTS

  • Referenced in 20 articles [sw05359]
  • metric operations (area, volume, curvature, etc.), 2D Delaunay and constrained Delaunay triangulations, robust geometric predicates...
  • Q-Morph

  • Referenced in 27 articles [sw08563]
  • used for recovering the boundary of a Delaunay mesh, is used on interior triangles...
  • DeWall

  • Referenced in 19 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...
  • geometry

  • Referenced in 13 articles [sw10010]
  • Octave and MATLAB. Qhull computes convex hulls, Delaunay triangulations, halfspace intersections about a point, Voronoi ... diagrams, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs ... convex hull. Qhull does not support constrained Delaunay triangulations, or mesh generation of non-convex ... Currently the package only gives access to Delaunay triangulation and convex hull computation...
  • EasyMesh

  • Referenced in 13 articles [sw13276]
  • features of EasyMesh: Generates two dimensional, unstructured, Delaunay and constrained Delaunay triangulations in general domains ... command line switch, creates a drawing with Delaunay and Voronoi mesh...
  • 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...
  • alphahull

  • Referenced in 15 articles [sw07945]
  • duality between the Voronoi diagram and Delaunay triangulation. The package also includes a function that ... returns the Delaunay mesh of a given sample of points and its dual Voronoi diagram...
  • CGALmesh

  • Referenced in 10 articles [sw12915]
  • document). CGALmeshed is based on the 3D Delaunay and regular triangulations from the CGAL library ... combines Delaunay refinement and Delaunay filtering through the notion of restricted Delaunay triangulation. Delaunay refinement...
  • dfnWorks

  • Referenced in 12 articles [sw22938]
  • mesh representation. The representation produces a conforming Delaunay triangulation suitable for high performance computing finite...