Science Fair Project Encyclopedia
Point set triangulation
A triangulation of a set of points P is the triangulation of the convex hull of P, with all points from P being among the vertices of the triangulation.
Sometimes it is desirable to have a triangulation with special properties, e.g., in which the triangles each have large angles ("splinter" triangles are avoided).
There are special triangulations like the Delaunay triangulation which is the geometric dual of the Voronoi diagram. Subsets of the Delaunay triangulation are the Gabriel graph , nearest neighbor graph and the minimal spanning tree.
Triangulation of the set of points may be a subproblem of the convex hull question in the space of dimension larger by 1.
10-26-2009 08:16:03
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details
The contents of this article is licensed from www.wikipedia.org under the GNU Free Documentation License. Click here to see the transparent copy and copyright details