andrewwillmott / splines-lib Goto Github PK

Contributors

Stargazers

Forkers

collector-m ezhangle jnmaloney hansonhoo deepankarsharma fpierl wjzhwht xiangfeng-shu smorodov jackstarred dongb5 user-mrh startat24 gboisse chuxu1793 lianghu3124 asdlei99 0000duck bhzhao-auto akonia khuong-nv owenliu-rdc johnlu655 zhgzheng shenweihuaa dezhi-l aarkham qubinghuo-source lavender-lee simpsonyinsc qiangsun89

int cnt = getcount(); // point count
Vec2f* in = new Vec2f[cnt]; // input points
cSpline2* splines = new cSpline2[cnt + 1]; // splines

// Make vector
for (int i = 0; i < cnt; i++) {  in[i].x = pt[i].getx(); in[i].y = p[i].gety(); }

// Splines
int numSplines = SplinesFromPoints(cnt, in, cnt + 1, splines);

// Query points from vector
for(int i = 0; i < cnt; i++)
{
  int index;
  float t = FindClosestPoint(in[i], cnt, splines, &index);
  Vec2f cp = Position(splines[index], t);
}

delete[] in;
delete[] splines;

float lengths[numSplines];
float remainLengths[numSplines];

for (int i = 0; i < numSplines; ++i) {
    lengths[i] = SplineLib::Length(splines[i], 0.01f);
    remainLengths[i] = lengths[i];
}

int splineIndex = 0;
float ts = 0.0f;

auto pushPoint = [&]() {
    dstPoints.emplace_back(Position(splines[splineIndex], ts));
    dstTangents.emplace_back(Velocity(splines[splineIndex], ts));
};

// push start point
pushPoint();

while (splineIndex < numSplines) {
    float step = space;
    loop:

    if (remainLengths[splineIndex] - step > 0) {
        remainLengths[splineIndex] -= step;
        ts += step / lengths[splineIndex];
        pushPoint();
    } else {
        step = step - remainLengths[splineIndex];
        ts = 0.0f;
        splineIndex++;
        if (splineIndex >= numSplines) {
            break;
        } else {
            goto loop;
        }
    }
}