Lines Matching defs:AET
162 EdgeTableEntry * AET, EdgeTableEntry * pETEs,
177 AET->next = NULL;
178 AET->back = NULL;
179 AET->nextWETE = NULL;
180 AET->bres.minor = MININT;
245 miloadAET(EdgeTableEntry * AET, EdgeTableEntry * ETEs)
250 pPrevAET = AET;
251 AET = AET->next;
253 while (AET && (AET->bres.minor < ETEs->bres.minor)) {
254 pPrevAET = AET;
255 AET = AET->next;
258 ETEs->next = AET;
259 if (AET)
260 AET->back = ETEs;
272 * This routine links the AET by the nextWETE (winding EdgeTableEntry) link for
273 * use by the winding number rule. The final Active Edge Table (AET) might
276 * AET
288 micomputeWAET(EdgeTableEntry * AET)
294 AET->nextWETE = NULL;
295 pWETE = AET;
296 AET = AET->next;
297 while (AET) {
298 if (AET->ClockWise)
304 pWETE->nextWETE = AET;
305 pWETE = AET;
308 AET = AET->next;
319 miInsertionSort(EdgeTableEntry * AET)
326 AET = AET->next;
327 while (AET) {
328 pETEinsert = AET;
329 pETEchase = AET;
330 while (pETEchase->back->bres.minor > AET->bres.minor)
333 AET = AET->next;
336 pETEinsert->back->next = AET;
337 if (AET)
338 AET->back = pETEinsert->back;
537 EdgeTableEntry *pPrevAET; /* previous AET entry */
539 EdgeTableEntry AET; /* Active ET header node */
551 if (!miCreateETandAET(count, ptsIn, &ET, &AET, pETEs, &SLLBlock)) {
567 miloadAET(&AET, pSLL->edgelist);
570 pPrevAET = &AET;
571 pAET = AET.next;
595 miInsertionSort(&AET);
609 miloadAET(&AET, pSLL->edgelist);
610 micomputeWAET(&AET);
613 pPrevAET = &AET;
614 pAET = AET.next;
655 if (miInsertionSort(&AET) || fixWAET) {
656 micomputeWAET(&AET);