|
Delaunay triangulation - Delaunaytriangulation (1070 words) |
 | In mathematics, and computational geometry, the Delaunay triangulation or Delone triangularization for a set P of points in the plane is the triangulation DT(P) of P such that no point in P is inside the circumcircle of any triangle in DT(P). |
| Delaunay triangulations maximize the minimum angle of all the angles of the triangles in the triangulation; they tend to avoid "sliver" triangles. |
| Delaunay triangulations are often used to build meshes for the finite element method, because of the angle guarantee and the fact that we know fast triangulation algorithms. |
| Boris Delaunay - Wikipedia, the free encyclopedia (165 words) |
| Boris Nikolaevich Delaunay (March 15, 1890 – July 17, 1980) (or Delone; Russian language: Борис Николаевич Делоне), was a Soviet/Russian mathematician. |
| The Delaunay triangulation was introduced by him in 1934 and is named in his honor. |
| He was born in Saint Petersburg, and died in Moscow. |
Feeds |
Contact