Function findPointInside

Engine/CoonsRegularization.cpp:896–937

}

static
Point
findPointInside(const BezierCPs& cps,
                double time)
{
    /*
       Given a simple polygon, find some point inside it. Here is a method based on the proof that
       there exists an internal diagonal, in [O'Rourke, 13-14]. The idea is that the midpoint of
       a diagonal is interior to the polygon.
     */
    assert( !cps.empty() );
    int i = 0;
    for (BezierCPs::const_iterator it = cps.begin(); it != cps.end(); ++it, ++i) {
        Point dir = dirVect(cps, time, i);
        if ( (dir.x == 0.) && (dir.y == 0.) ) {
            continue;
        }
        Point p;
        (*it)->getPositionAtTime(false, time, ViewIdx(0), &p.x, &p.y);
        Point q;
        q.x = p.x;
        q.y = p.y + dir.y;
        BezierCPPtr newPoint;
        int beforeIndex = -1;
        findIntersection(cps, time, p, q, &newPoint, &beforeIndex);
        if ( newPoint && (beforeIndex != -1) ) {
            Point np;
            newPoint->getPositionAtTime(false, time, ViewIdx(0), &np.x, &np.y);
            if ( (np.x != p.x) || (np.y != p.y) ) {
                Point m;
                m.x = 0.5 * (p.x + np.x);
                m.y = 0.5 * (p.y + np.y);

                return m;
            }
        }
    }
    Point ret;
    cps.front()->getPositionAtTime(false, time, ViewIdx(0), &ret.x, &ret.y);

    return ret;
}

static double
estimate(int elen,