bn:03775838n
Noun Concept
Categories: Geometric algorithms, Triangulation (geometry), Articles with short description, archived copy as title
EN
Delaunay triangulation  Applications of Delaunay triangulation  Delaunay algorithm  Delaunay cell  Delaunay tessellation
EN
In mathematics and computational geometry, a Delaunay triangulation, also known as a Delone triangulation, for a given set {pi} of discrete points pi in general position is a triangulation such that no point pi is inside the circumcircle of any triangle in the DT. Wikipedia
Definitions
Relations
Sources
EN
In mathematics and computational geometry, a Delaunay triangulation, also known as a Delone triangulation, for a given set {pi} of discrete points pi in general position is a triangulation such that no point pi is inside the circumcircle of any triangle in the DT. Wikipedia
Triangulation method named after Boris Delaunay Wikidata
For a given set P of discrete points in a plane: a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P). Wiktionary