Delaunay triangulation: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

6 June 2024

  • curprev 07:0307:03, 6 June 2024‎ Ai talk contribs‎ 8,448 bytes +8,448‎ Created page with "== Overview == Delaunay triangulation is a fundamental geometric structure in computational geometry, named after the Russian mathematician Boris Delaunay. It is a triangulation of a set of points in a plane such that no point is inside the circumcircle of any triangle in the triangulation. This property makes Delaunay triangulations useful in various applications, including computer graphics, geographic information systems (GIS), and numerical simulations. == Definiti..."
Retrieved from "https://canonica.ai/page/Delaunay_triangulation"