Editing Delaunay simplexes
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
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 | 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''. Delaunay triangulation fulfils the so called '''empty circle property''', i.e. | ||
the circumscribing circle of each facet of such a triangulation does not contain any other vertex of the triangulation in its interior. A similar property holds for tetrahedralisation in three dimensions. | |||
==External links== | |||
*[http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/packages.html#part_VIII The CGAL project on computational geometry] | |||
==References== | ==References== | ||
#Математические основы структурного анализа кристаллов (совместно с А.Д.Александровым и Н.Падуровым), Москва, Матем. литература, 1934 г. | #Математические основы структурного анализа кристаллов (совместно с А.Д.Александровым и Н.Падуровым), Москва, Матем. литература, 1934 г. | ||
[[category: mathematics]] | [[category: mathematics]] |