作业一:任意斜率直线的DD△画线法、中点画线法、Bresenh△m画线法的推导,写出详细算法原理、算法表示,并进行几种算法精度和速度的比较分析。(对接实验进行验证)
作业二:中点画圆法、Bresenh△m画圆法、多边形逼近画圆法及任意角度范围的圆弧的算法推导,并进行几种算法精度和速度的比较分析。(对接实验进行验证)
作业一
4.几种算法精度和速度的比较分析
void CCG2020112282XXXGDI2DView::OnDraw2dlinetime()
{
// TODO: 在此添加命令处理程序代码
if (mRenderContext == nullptr) return;
#ifdef USEMEMDC
mRenderContext->setView(this);
#endif // USEMEMDC
//生成一定数量的端点坐标
static Vec2i P[20000];
for (int i = 0; i < 20000; i += 2) {
P[i] = Vec2i(rand() % 1670, rand() % 700);
P[i + 1] = Vec2i(rand() % 1670, rand() % 700);
}
//定义计时用的参数
LARGE_INTEGER frequency, start, end;//计时
QueryPerformanceFrequency(&frequency);
//DDA算法
QueryPerformanceCounter(&start); //绘制前计时
for (int i = 0; i < 20000; i += 2) {
mRenderContext->DDALine(P[i], P[i + 1], RGB(255, 0, 0));
}
QueryPerformanceCounter(&end); //绘制结束计时
//算出持续时间
double fitDDA = (double)(end.QuadPart - start.QuadPart) / (double)frequency.QuadPart;
CString strFitin;
strFitin.Format(_T("DDALine:%.6f"), fitDDA);
AfxMessageBox(strFitin);
//中点算法
QueryPerformanceCounter(&start); //绘制前计时
for (int i = 0; i < 20000; i += 2) {
mRenderContext->MidPointLine(P[i], P[i + 1], RGB(255, 0, 0));
}
QueryPerformanceCounter(&end); //绘制结束计时
//算出持续时间
double fitMidPoint = (double)(end.QuadPart - start.QuadPart) / (double)frequency.QuadPart;
CString strFitin1;
strFitin1.Format(_T("MidPointLine:%.6f"), fitMidPoint);
AfxMessageBox(strFitin1);
//Bresenham算法
QueryPerformanceCounter(&start); //绘制前计时
for (int i = 0; i < 20000; i += 2) {
mRenderContext->BresenhamLine(P[i], P[i + 1], RGB(255, 0, 0));
}
QueryPerformanceCounter(&end); //绘制结束计时
//算出持续时间
double fitBresenham = (double)(end.QuadPart - start.QuadPart) / (double)frequency.QuadPart;
CString strFitin2;
strFitin2.Format(_T("BresenhamLine:%.6f"), fitBresenham);
AfxMessageBox(strFitin2);
#ifdef USEMEMDC
((CGDI2DRenderContext*)mRenderContext)->SwapBackBuffer();
#endif // USEMEMDC
}
比较三种算法:
1.DDA画线算法
MidPointLine:
BresehamLine:
综上可知DDA效率最高。
作业二:
4.几种算法精度和速度的比较分析
编码上边有的;