An edge record stores endpoint vertices of a polyhedron, its two incident faces, and predecessor and successor edges for each face. These four boundary-neighbour references are the wings. Face and vertex of a polyhedron records also carry entry references for traversal. Local edits must preserve all reciprocal incidence references and orientations.
Articles by others on the same topic
The term "winged edge" is commonly used in computer graphics and computational geometry, particularly in the context of representing and manipulating polygonal meshes. A winged edge data structure is designed to efficiently store the connectivity of a mesh, particularly in 3D modeling, by capturing the relationships between vertices, edges, and faces. ### Key Features of Winged Edge Data Structure: 1. **Edge-Centric Representation**: Each edge in the mesh has several associated properties.