Face Table:

The winged-edge data structure needs two more tables, the vertex table & the face table. These two are very easy. The vertex table (Table (a)) contain one entry for each vertex which has an edge that is incident to this vertex. The face table (Table (b)) has one entry for each face which has an edge that is one of this face's boundary edges. Hence, we have the following table. Note down that since there are multiple choices of edges, you might come up with different tables:

                     Table (a) : Vertex Table                                          Table (b) : Face Table

Along this data structure, one may easily answer the question: which one vertex, edges, faces is adjacent to each face, edge, or vertex. There are nine adjacency relations. For instance, is vertex X adjacent to face 5? Are faces 3 & 5 adjacent to each other? The winged-edge data structure may answer these queries extremely efficiently and some of them can even be answered in constant time. Though, it can take longer time to answer other adjacency queries. Note down also that once the numbers of edges, vertices and faces are known, the size of all three tables are fixed and shall not change.