Delaunay simplexes: Difference between revisions
Jump to navigation
Jump to search
mNo edit summary |
mNo 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''. Delaunay triangulation | 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''. | ||
the circumscribing circle of | |||
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== | ==External links== | ||
*[http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/packages.html#part_VIII The CGAL project on computational geometry] | *[http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/packages.html#part_VIII The CGAL project on computational geometry] | ||
Revision as of 11:23, 9 October 2007
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
- Математические основы структурного анализа кристаллов (совместно с А.Д.Александровым и Н.Падуровым), Москва, Матем. литература, 1934 г.