GMS:Triangulation

From XMS Wiki
Revision as of 23:19, 15 June 2011 by Ksmith (talk | contribs)
Jump to navigationJump to search

A TIN is constructed by triangulating a set of vertices. The vertices are connected with a series of edges to form a network of triangles. The resulting triangulation satisfies the Delauney criterion. The Delauney criterion ensures that no vertex lies within the interior of any of the circumcircles of the triangles in the network as shown below:

File:Del criterion.gif

Two Adjacent Triangles Which (a) Violate and (b) Honor the Delauney Criterion.

The result of enforcing the Delauney criterion is that long thin triangles are avoided as much as possible.

The vertices associated with the active TIN can be triangulated using the Triangulate command from the TIN menu, or by right-clicking on the TIN in the Project Explorer and selecting the Triangulate command.


See also