- Winged edge
The winged edge data structure is a commonly used data representation used to describe polygon models in computer graphics. It explicitly describes the geometry and
topology of faces, edges, and vertices when three or more surfaces come together and meet at a common edge. The ordering is such that the surfaces are ordered counter-clockwise with respect to the innate orientation of the intersection edge. Moreover the representation allows numerically unstable situations like that depicted below.The winged edge data structure allows for quick traversal between faces, edges, and vertices due to the explicitly linked structure of the network. This rich form of specifying an
unstructured grid is in contrast to more simple specifications ofpolygon mesh es such as a node and element list, or the implied connectivity of aregular grid .See also
*
Quad-edge data structure External links
* [http://www.baumgart.org/winged-edge/winged-edge.html Winged Edge Polyhedron Representation for Computer Vision] , Bruce G. Baumgart
* [http://www.cs.mtu.edu/~shene/COURSES/cs3621/NOTES/model/winged-e.html The Winged-Edge Data Structure] , on Michigan Technological University
* [http://medialab.di.unipi.it/web/IUM/Waterloo/node119.html Winged Edge] , on university of Pisa
Wikimedia Foundation. 2010.