本文介绍了一个简单的二维坐标旋转算法，该算法使用了正弦和余弦函数来完成坐标点相对于中心点的旋转操作。通过传入原始坐标和旋转角度，算法能够计算出旋转后的坐标位置。
bool pointRotate(int centerX, int centerY, int fromX, int fromY, double dir, int& toX, int& toY)
{
/*
toX = (fromX - centerX) * cos(dir) +
(fromY - centerY) * sin(dir) + centerX;
toY = -(fromX - centerX) * sin(dir) +
(fromY - centerY) * cos(dir) + centerY;
*/
double dSin, dCos;
sincos(dir, &dSin, &dCos);
toX = (fromX - centerX) * dCos +
(fromY - centerY) * dSin + centerX;
toY = -(fromX - centerX) * dSin +
(fromY - centerY) * dCos + centerY;
return true;
}
{
/*
toX = (fromX - centerX) * cos(dir) +
(fromY - centerY) * sin(dir) + centerX;
toY = -(fromX - centerX) * sin(dir) +
(fromY - centerY) * cos(dir) + centerY;
*/
double dSin, dCos;
sincos(dir, &dSin, &dCos);
toX = (fromX - centerX) * dCos +
(fromY - centerY) * dSin + centerX;
toY = -(fromX - centerX) * dSin +
(fromY - centerY) * dCos + centerY;
return true;
}
扫一扫
3728
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
