插值算法

int distance(int x1, int y1, int x2, int y2)
{
return std::max(std::abs(x1 - x2), std::abs(y1 - y2));
}


bool lerp(int fromX, int fromY, int  toX, int toY, double step, double stepTotal, int& curX, int& curY)
{
if (0 == stepTotal)
{
curX = fromX;
curY = fromY;
}
else if (0 == step)
{
curX = fromX;
curY = fromY;
}
else if (step == stepTotal)
{
curX = toX;
curY = toY;
}
else
{
double scale = step / stepTotal;
curX = fromX + (int)(round(((double)toX - fromX)*scale));
curY = fromY + (int)(round(((double)toY - fromY)*scale));
}
return true;
}


void test()
{
int x1 = 1, y1 = 1, x2 = 4, y2 = 4;
int distan = distance(x1, y1, x2, y2);


if (distan <= 0)
{
return;
}


for (int i = 0; i <= distan; i++)
{
int curX = 0;
int curY = 0;
lerp(x1, y1, x2, y2,(double)i, (double)distan, curX, curY);
printf("(%d,%d)\n", curX, curY);
}
}


int main()
{
test();
while (1);
return 0;
}