+++ title = "Triangulations and Tessellations" +++
Two common methods for partitioning space into individual elements are triangulations and tessellations. This section is dedicated to packages that implement such methods.
DelaunayTriangulation.jl is the most supported package for Delaunay triangulations and Voronoi tessellations in two dimensions. Delaunator.jl might be faster for unconstrained triangulations if you do not need exact arithmetic. In higher dimensions, you need Delaunay.jl if
{{badge DelaunayTriangulation}} A pure Julia library for constructing planar triangulations with support for both unconstrained and constrained triangulations (including domains with holes, disjoint domains, etc.), mesh refinement, Voronoi tessellations, clipped and centroidal Voronoi tessellations, and dynamic updates. Uses exact geometric predicates and supports custom types.
{{badge VoronoiDelaunay}}
A pure Julia library that constructs planar triangulations and tessellations, although no support for constrained triangulations / mesh refinement or clipped / centroid tessellations. Restricts points to
{{badge VoronoiCells}}
A pure Julia library that extends VoronoiDelaunay.jl. This package provides useful tools for constructing and working with Voronoi tessellations. Supports clipping Voronoi cells to a specified rectangle. Like VoronoiDelaunay.jl, restricts points to
{{badge Delaunay}}
Wraps Python's main Delaunay triangulation library, scipy.spatial.Delaunay, for computing Delaunay triangulations in
{{badge MiniQhull}}
Wraps Qhull for computing unconstrained Delaunay triangulations in
{{badge DirectQhull}} Similar to MiniQhull.jl, although also provides support for convex hulls and Voronoi tessellations from Qhull.
{{badge Delaunator}} A pure Julia library modelled after the JavaScript Delaunator library. This package can construct unconstrained triangulations of planar point sets. No support is available for constrained triangulations or mesh refinement, although support exists for computing the dual Voronoi tessellation. Centroidal tessellations are not implemented, although the Voronoi cells can be clipped to a bounding box.
{{badge TriangleMesh}} Interfaces to Shewchuk's Triangle library.
{{badge Triangulate}} Interfaces to Shewchuk's Triangle library.
{{badge Triangle}} Interfaces to Shewchuk's Triangle library.
{{badge TetGen}} This is for Delaunay tetrahedralisation, wrapping TetGen.
{{badge GMT}} A wrapper of GMT, allowing for unconstrained Delaunay triangulations in two dimensions, and for spherical triangulation, i.e. triangulation of points lying on a sphere.