1.Bresenham画圆
int r,d,x,y,x0,y0;
DCPoint->SetROP2(R2_COPYPEN);//绘图方法为直接画
r=(int)sqrt(((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y))*1.0);
x=0;y=r;d=3-2*r;x0=p1.x;y0=p1.y;
while(x<y||x==y)
{
DCPoint->SetPixel(x+x0,y+y0,m_crColor);
DCPoint->SetPixel(-x+x0,y+y0,m_crColor);
DCPoint->SetPixel(x+x0,-y+y0,m_crColor);
DCPoint->SetPixel(-x+x0,-y+y0,m_crColor);
DCPoint->SetPixel(y+x0,x+y0,m_crColor);
DCPoint->SetPixel(-y+x0,x+y0,m_crColor);
DCPoint->SetPixel(y+x0,-x+y0,m_crColor);
DCPoint->SetPixel(-y+x0,-x+y0,m_crColor);
x=x+1;
if(d<0||d==0)
{
d=d+4*x+6;
}
else
{
y=y-1;d=d+4*(x-y)+10;
}
};
2.正负法圆
int r,d,x,y,x0,y0;
DCPoint->SetROP2(R2_COPYPEN);//绘图方法为直接画
r=(int)sqrt(((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y))*1.0);
d=0;x0=p1.x;y0=p1.y;x=x0;y=y0+r;
while(y>y0)
{
DCPoint->SetPixel(x,y,m_crColor);
DCPoint->SetPixel(-x+2*x0,y,m_crColor);
DCPoint->SetPixel(x,-y+2*y0,m_crColor);
DCPoint->SetPixel(-x+2*x0,-y+2*y0,m_crColor);
if(d<0)
{
x++;d=d+2*(x-x0)+1;
}
else
{
y--;d=d-2*(y-y0)+1;
}
};
本文详细介绍了两种画圆算法:Bresenham算法和正负法。通过具体代码展示了如何使用这两种算法在二维平面上绘制圆形,深入探讨了算法的工作原理及其在计算机图形学中的应用。
&spm=1001.2101.3001.5002&articleId=86412025&d=1&t=3&u=891a68980a5446ffa5ff9a6ab2b906a0)
6605

被折叠的 条评论
为什么被折叠?



