數字微分分析儀(digital differential analyzer)方法是一種線段掃描轉換算法。
DDA算法比直接使用直線方程計算的速度更快,它利用光柵特性消除了直線方程種的乘法。
本代碼參考自《計算機圖形學》第四版,該函數將在verts末尾按次序添加需要的點坐標
inline int round(const float a)
{
return int(a + 0.5);
}
void GLApp::lineDDA(std::vector<glm::vec2> &verts,int x0, int y0, int xEnd, int yEnd) { int dx = xEnd - x0, dy = yEnd - y0, steps, k; float xIncrement, yIncrement, x = x0, y = y0; if (fabs(dx) > fabs(dy)) { steps = fabs(dx); } else { steps = fabs(dy); } xIncrement = float(dx) / float(steps); yIncrement = float(dy) / float(steps); verts.push_back(glm::vec2(round(x), round(y))); for (k = 0; k < steps; ++k) { x += xIncrement; y += yIncrement; verts.push_back(glm::vec2(round(x), round(y))); } }
