正在阅读：贝赛尔曲线的拆分算法贝赛尔曲线的拆分算法

                            InciseBezier(&polyPt[i], ptBuffer);

                            polyPt.RemoveAt(i+1,2);

                            polyPt.InsertAt(i+1,ptBuffer[1],5);

                            for(j=0;j<4;j++)

                                   polyPt[i+2+j] = ptBuffer[2+j];

                            i += 3;

                            count += 3;

                     }

              }

              if(bExit)

                     break;

       }

       count = polyPt.GetSize();

       i=0;

       while(i<count-1){

              if(polyPt[i] ==polyPt[i+1]){

                     polyPt.RemoveAt(i+1);

                     count--;

                     continue;

              }

              i++;

       }

       return true;

  }

  /计算贝赛尔曲线两个顶点的纵向和横向的最大距离

  int GetBezierGap(CPoint *p)

  {

       int gap = 0;

       for(int i=1;i<4;i++){

              if(abs(p[i].x-p[i-1].x)>gap)