如何在C中实现曲线的自适应细分算法

时间:2015-09-30 14:01:46

标签: c opengl glut bezier

我的作业是用openGL / Glut编写一个C程序,在通过鼠标点击(3个坐标点)获得4个点组后,应该用自适应算法绘制贝塞尔曲线。在理论层面,它清楚算法是如何工作的,但我不知道如何将它放在C代码中。我的意思是,在课上我们看到4个控制点的形状类似于"空中飞人"然后算法计算两个"高度"然后检查它们是否满足容差。问题是用户可能会点击屏幕中的任何地方,这些点可能没有类似飞人的形状......所以,我从哪里开始?这就是我的全部

enter image description here

这是我写的cole,每次添加一个控制点时都会调用它:

if (bezierMode == CASTELJAU_ADAPTIVE) {
    glColor3f (0.0f, 0.8f, 0.4f); /* draw adaptive casteljau curve in green */
    for(i=0; i+3<numCV; i += 3)
        adaptiveDeCasteljau3(CV, i, 0.01);
}


void adaptiveDeCasteljau3(float CV[MAX_CV][3], int position, float tolerance)  {

  float x01 = (CV[position][0] + CV[position+1][0]) / 2;
  float y01 = (CV[position][1] + CV[position+1][1]) / 2;

  float x12 = (CV[position+1][0] + CV[position+2][0]) / 2;
  float y12 = (CV[position+1][1] + CV[position+2][1]) / 2;

  float x23 = (CV[position+2][0] + CV[position+3][0]) / 2;
  float y23 = (CV[position+2][1] + CV[position+3][1]) / 2;

  float x012 = (x01 + x12) / 2;
  float y012 = (y01 + y12) / 2;

  float x123 = (x12 + x23) / 2;
  float y123 = (y12 + y23) / 2;

  float x0123 = (x012 + x123) / 2;
  float y0123 = (y012 + y123) / 2;

  float dx = CV[3][0] - CV[0][0];
  float dy = CV[3][1] - CV[0][1];

  float d2 = fabs(((CV[1][0] - CV[3][0]) * dy - (CV[1][1] - CV[3][1]) * dx));
  float d3 = fabs(((CV[2][0] - CV[3][0]) * dy - (CV[2][1] - CV[3][1]) * dx));

  if((d2 + d3)*(d2 + d3) < tolerance * (dx*dx + dy*dy)) {

      glBegin(GL_LINE_STRIP);
          glVertex2f(x0123, y0123);
      glEnd();

      return;
  }

  float tmpLEFT[4][3];
  float tmpRIGHT[4][3];

  tmpLEFT[0][0] = CV[0][0];
  tmpLEFT[0][1] = CV[0][1];
  tmpLEFT[1][0] = x01;
  tmpLEFT[1][1] = y01;
  tmpLEFT[2][0] = x012;
  tmpLEFT[2][1] = y012;
  tmpLEFT[3][0] = x0123;
  tmpLEFT[3][1] = y0123;

  tmpRIGHT[0][0] = x0123;
  tmpRIGHT[0][1] = y0123;
  tmpRIGHT[1][0] = x123;
  tmpRIGHT[1][1] = y123;
  tmpRIGHT[2][0] = x23;
  tmpRIGHT[2][1] = y23;
  tmpRIGHT[3][0] = CV[3][0];
  tmpRIGHT[3][1] = CV[3][1];

  adaptiveDeCasteljau3(tmpLEFT, 0, tolerance);
  adaptiveDeCasteljau3(tmpRIGHT, 0, tolerance);


}

显然什么都没画。你有什么想法吗?

1 个答案:

答案 0 :(得分:1)

Begin / End应该吞没你的整个循环,而不是在每个孤立的顶点内部!