Lines Matching refs:is
4 * Use of this source code is governed by a BSD-style license that can be
46 of winding or even/odd, eliminates the coincident edge, i.e., the result is
110 to be sorted to know which segment is next on the outside, although sometimes
111 we can use that it is not coincident just to follow the direction.
113 If it is coincident or if there's more than two crossing segments, sorting
116 Likewise, to resolve whether one contour is inside another, it seems that
117 sorting is required. Given a pair of segments on different contours, to know
118 if one is inside of the other, I need to know for each which side of the edge
119 is the inside/filled side. When the outer contour is walked, it seems like I
120 could record the inside info. I guess when the inner contour is found, its
121 inside sense is reversed (inside is above the top). But how do I know if the
122 next contour is inside another? Maybe shoot out a line and brute-force
128 (or straight up from any point on the segment). This ray is not intersected
129 with the home contour, but is intersected with all other contours as part of
130 the normal intersection engine. If it is possible to get from the T values to
132 count the contour crossings and determine if the home contour is in another
133 contour or not (if the count is even, not, if odd, is inside). By itself that
137 Since intersecting these rays is unrelated to computing other intersections,
138 it can be lazily done once the contour is found.
147 count the crossings, determine if disjoint is inside or outside, then continue
157 Or, is there something defective in the current approach that makes the end
166 Another approach is to determine how flat the curve is to make good guesses
168 and/or to determine whether one curve is to the inside or outside of another.