GMS:Triangulation: Difference between revisions

From XMS Wiki
Jump to navigationJump to search
No edit summary
No edit summary
Line 1: Line 1:
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:
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 Delaunay criterion. The Delaunay criterion ensures that no vertex lies within the interior of any of the circumcircles of the triangles in the network as shown below:


[[Image:del_criterion.gif|frame|center|Two Adjacent Triangles Which (a) Violate and (b) Honor the Delauney Criterion.|250px]]
[[Image:del_criterion.gif|frame|center|Two Adjacent Triangles Which (a) Violate and (b) Honor the Delaunay Criterion.|250px]]


The result of enforcing the Delauney criterion is that long thin triangles are avoided as much as possible.
The result of enforcing the Delaunay 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 [[GMS:The GMS Window|Project Explorer]] and selecting the '''Triangulate''' command.
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 [[GMS:The GMS Window|Project Explorer]] and selecting the '''Triangulate''' command.

Revision as of 17:16, 23 October 2015

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 Delaunay criterion. The Delaunay 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 Delaunay Criterion.

The result of enforcing the Delaunay 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


[[