Lines Matching full:sweep
39 ** $Header: //depot/main/gfx/lib/glu/libtess/sweep.c#5 $
54 #include "sweep.h"
68 * at any valid location of the sweep event
69 * - if EdgeLeq(e2,e1) as well (at any valid sweep event), then e1 and e2
73 * where "event" is the current sweep line event.
77 * - the portion of the mesh left of the sweep line is a planar graph,
85 * Invariants for the Sweep.
115 * current sweep line position, given by tess->event. The calculations
118 * Special case: if both edge destinations are at the sweep event,
131 /* Two edges right of the sweep line which meet at the sweep event.
218 * Add a new active region to the sweep line, *somewhere* below "regAbove"
219 * (according to where the new edge belongs in the sweep-line dictionary).
269 * Delete a region from the sweep line. This happens when the upper
270 * and lower chains of a region meet (at a vertex on the sweep line).
294 * in the sweep). The walk stops at the region above regLast; if regLast
658 /* The intersection point lies slightly to the left of the sweep line,
659 * so move it until it''s slightly to the right of the sweep line.
691 * wrong side of the sweep event, or through it. This can happen
934 * before we process the sweep event, some degenerate cases can't occur.
1010 * the rightmost vertex of U or L lying to the left of the sweep line
1071 * Does everything necessary when the sweep line crosses a vertex.
1161 * We maintain an ordering of edge intersections with the sweep line.
1237 * order in which vertices cross the sweep line.
1315 /* Each vertex defines an event for our sweep line. Start by inserting
1337 * be processed by separate sweep events). Suppose another edge C
