Lines Matching refs:intersections
9 #include "Intersections.h"
83 LineCubicIntersections(const Cubic& c, const _Line& l, Intersections& i)
86 , intersections(i) {
89 // see parallel routine in line quadratic intersections
112 intersections.insert(cubicT, lineT, pt);
115 return intersections.fUsed;
135 intersections.insert(cubicT, lineT, pt);
141 return intersections.fUsed;
161 intersections.insert(cubicT, lineT, pt);
167 return intersections.fUsed;
177 intersections.insert(cIndex >> 1, lIndex, line[lIndex]);
190 intersections.insert(cIndex >> 1, 0, cubic[cIndex]);
193 intersections.insert(cIndex >> 1, 1, cubic[cIndex]);
205 intersections.insert(cIndex >> 1, 0, cubic[cIndex]);
208 intersections.insert(cIndex >> 1, 1, cubic[cIndex]);
226 int roots = intersections.fUsed;
228 intersections.fT[1][index] = 1 - intersections.fT[1][index];
256 Intersections& intersections;
261 LineCubicIntersections c(cubic, *((_Line*) 0), *((Intersections*) 0));
277 bool flipped, Intersections& intersections) {
278 LineCubicIntersections c(cubic, *((_Line*) 0), intersections);
283 bool flipped, Intersections& intersections) {
284 LineCubicIntersections c(cubic, *((_Line*) 0), intersections);
288 int intersect(const Cubic& cubic, const _Line& line, Intersections& i) {
293 int intersectRay(const Cubic& cubic, const _Line& line, Intersections& i) {
