Provides a mesh data structure.Namespace: ceometric.ComputationalGeometry
Assembly: ceometric.ComputationalGeometry (in ceometric.ComputationalGeometry.dll) Version: 126.96.36.199 (188.8.131.52)
A mesh is a data structure comprising a list of vertices and a list of mesh triangles whereby an mesh triangle is a list of three integer values referring to the indices of the vertex list. The mesh also has fully referenced adjacency information. Vertices know their incident triangles, edges know their adjacent triangles and triangles know the edges they are composed of. The mesh also features a polygon reduction algorithm (LOD, level of detail). The objective of LOD is to take a high-detail model with many polygons and to generate a version using fewer polygons that looks reasonably similar to the original. The reduction is done by collapsing edges. The edge collapse criterion follows a robust heuristic proposed by Stan Melax (see http://www.melax.com/polychop).