Lines Matching defs:Sym
68 * Each half-edge has a pointer to its mate (the "symmetric" half-edge Sym),
75 * Sym = the mate of a half-edge (same edge, but opposite direction)
88 * in pairs (e and e->Sym), each half-edge stores a pointer in only
90 * will visit each *edge* once (ie. e or e->Sym, but not both).
91 * e->Sym stores a pointer in the opposite direction, thus it is
92 * always true that e->Sym->next->Sym->next == e.
146 GLUhalfEdge *next; /* doubly-linked list (prev==Sym->next) */
147 GLUhalfEdge *Sym; /* same edge, opposite direction */
159 #define Rface Sym->Lface
160 #define Dst Sym->Org
162 #define Oprev Sym->Lnext
163 #define Lprev Onext->Sym
164 #define Dprev Lnext->Sym
165 #define Rprev Sym->Onext
166 #define Dnext Rprev->Sym /* 3 pointers */
167 #define Rnext Oprev->Sym /* 3 pointers */
