|
A mesh is a collection of vertices and polygons that define the shape of an object in 3D computer graphics.
Meshes usually contain only triangles for easy calculations, but can also represent objects made of general polygons with optional holes.
Examples of internal mesh structure representations:
- simple list of vertices with a list of indices describing which vertices are linked to form polygons; additional information can describe a list of holes
- list of vertices + list of edges (pairs of indices) + list of polygons that link edges
- winged-edge data structure
The choice of the data structure is governed by the application: it's easier to deal with triangles than general polygons, especially in computational geometry. For optimized algorithms it is necessary to have a fast access to topological informations such as edges or neighbouring faces, this requires more complex structures such as the winged-edge representation.
|
