南京邮电大学计算机图形学期末考试计算题真题
- 1、下载文档前请自行甄别文档内容的完整性,平台不提供额外的编辑、内容补充、找答案等附加服务。
- 2、"仅部分预览"的文档,不可在线预览部分如存在完整性等问题,可反馈申请退款(可完整预览的文档不适用该条件!)。
- 3、如文档侵犯您的权益,请联系客服反馈,我们会尽快为您处理(人工客服工作时间:9:00-18:30)。
e integral Midpoint Line Algorithm to scan-converting a line segment between
pixel(1,0) and pixel(4,7),Please give out the development process of the algorithm and the judgement value of each step,then plot the scan pixels in Fig 1
e integral DDA Algorithm to scan-converting a line segment between pixel(1,0) and
pixel(4,7),Please give out the development process of the algorithm and the judgement value of each step,then plot the scan pixels in Fig 1
3.The coordinates of the line segment AB are A(9,1) B(8,3),Try to give out the
transformation matrix for calculating the coordinates of point A’ and point B’ which are the reflections of point A and point B with respect to line segment P1P2
(P1(3,-1),P2(6,3)) (Use homogeneous coordinate)
线段AB的坐标是(9,1)B(8、3),尝试给出了变换矩阵计算坐标的A点和B点的A点和B点的反射对线段P1P2
(P1(3,1),P2(6 3))(用齐次坐标)
4.The Fig 2 shows a triangle ABC(A(1,2) B(5,2) C(3,5)),Try to calculate the coordinate of
its reflections A’ B’ C’ with respect to line X=6 (Use homogeneous coordinate and give out the transformation matrix)
图2显示了一个三角形ABC(B(1、2)(2)C(3、5)),试图计算坐标的反射' B ' C '就行
X = 6(用齐次坐标变换矩阵和发放)
e seed-filling algorithm to fill the region in Fig 3,please give out the sequentially
stacked seed cooridates and max required stack space
6.The clip window is defined by (200,200) and (600,600) .Please give out the code of
P1and P2 using the Cohen-Sutherland algorithm (P1(250,50) P2(100,300)) ,give out the clip result,plot the window and the line P1P2.
7.Please give out the peseudo code of recursive seed filling algorithm for 8-connected
interior-defined region
8.Please give out the clipping result of the ploygon using left window boundary.
请给出多变相的剪裁结果使用左窗口边界。