Delaunay simplexes: Difference between revisions

From SklogWiki
Jump to navigation Jump to search
mNo edit summary
No edit summary
Line 1: Line 1:
[[Image:Delaunay.png|thumb|An example of  Delaunay triangulation in two-dimensions]]
[[Image:Delaunay.png|thumb|An example of  Delaunay triangulation in two-dimensions]]
A '''Delaunay simplex''' is the dual of the [[Voronoi cells |Voronoi diagram]]. Delaunay  simplexes were developed by Борис Николаевич Делоне. In two-dimensions <math>({\mathbb R}^2)</math> it is more commonly known as ''Delaunay triangulation'', and in three-dimensions <math>({\mathbb R}^3)</math>, as ''Delaunay tetrahedralisation''.
A '''Delaunay simplex''' is the [[dual lattice | dual]]  of the [[Voronoi cells |Voronoi diagram]]. Delaunay  simplexes were developed by Борис Николаевич Делоне. In two-dimensions <math>({\mathbb R}^2)</math> it is more commonly known as ''Delaunay triangulation'', and in three-dimensions <math>({\mathbb R}^3)</math>, as ''Delaunay tetrahedralisation''.


A Delaunay triangulation fulfills the ''empty circle property'' (also called ''Delaunay property''): the circumscribing circle of any facet of the triangulation contains no data point in its interior. For a point set with no subset of four co-circular points the Delaunay triangulation is unique. A similar property holds for tetrahedralisation in three dimensions.
A Delaunay triangulation fulfills the ''empty circle property'' (also called ''Delaunay property''): the circumscribing circle of any facet of the triangulation contains no data point in its interior. For a point set with no subset of four co-circular points the Delaunay triangulation is unique. A similar property holds for tetrahedralisation in three dimensions.

Revision as of 14:15, 30 October 2007

An example of Delaunay triangulation in two-dimensions

A Delaunay simplex is the dual of the Voronoi diagram. Delaunay simplexes were developed by Борис Николаевич Делоне. In two-dimensions it is more commonly known as Delaunay triangulation, and in three-dimensions , as Delaunay tetrahedralisation.

A Delaunay triangulation fulfills the empty circle property (also called Delaunay property): the circumscribing circle of any facet of the triangulation contains no data point in its interior. For a point set with no subset of four co-circular points the Delaunay triangulation is unique. A similar property holds for tetrahedralisation in three dimensions.

External links

References

  1. Математические основы структурного анализа кристаллов (совместно с А.Д.Александровым и Н.Падуровым), Москва, Матем. литература, 1934 г.