Method regularize

Engine/CoonsRegularization.cpp:1379–1571

}

void
CoonsRegularization::regularize(const BezierCPs &patch,
                                double time,
                                std::list<BezierCPs> *fixedPatch)
{
    if (patch.size() < 3) {
        fixedPatch->push_back(patch);

        return;
    }

    Point pointInside = findPointInside(patch, time);
    int sign;
    {
        RectD bbox;
        bbox.x1 = std::numeric_limits<double>::infinity();
        bbox.x2 = -std::numeric_limits<double>::infinity();
        bbox.y1 = std::numeric_limits<double>::infinity();
        bbox.y2 = -std::numeric_limits<double>::infinity();
        Bezier::bezierSegmentListBboxUpdate(false, patch, true, false, time, ViewIdx(0), 0, Transform::Matrix3x3(), &bbox);
        if ( !bbox.contains(pointInside.x, pointInside.y) ) {
            sign = 0;
        } else {
            int winding_number = computeWindingNumber(patch, time, pointInside);
            sign = (winding_number < 0) ? -1 : ( (winding_number > 0) ? 1 : 0 );
        }
    }
    std::list<BezierCPs> splits;
    if ( checkAnglesAndSplitIfNeeded(patch, time, sign, &splits) ) {
        *fixedPatch = splits;

        return;
    }

    Point P[4][4];
    coonsPatch(patch, time, P);

    //Check for degeneracy
    Point U[3][4];
    Point V[4][3];

    for (int i = 0; i < 3; ++i) {
        for (int j = 0; j < 4; ++j) {
            U[i][j].x = P[i + 1][j].x - P[i][j].x;
            U[i][j].y = P[i + 1][j].y - P[i][j].y;
        }
    }
    for (int i = 0; i < 4; ++i) {
        for (int j = 0; j < 3; ++j) {
            V[i][j].x = P[i][j + 1].x - P[i][j].x;
            V[i][j].y = P[i][j + 1].y - P[i][j].y;
        }
    }

    int choose2[3] = {1, 2, 1};
    int choose3[4] = {1, 3, 3, 1};
    double T[6][6];
    for (int p = 0; p < 6; ++p) {