Search - polygon line

Search - polygon line - List

[Console] graphics DL : 0: １）给出系统框架。２）调用画点的函数，分别用DDA、中点Bresenham算法和改进Bresenham算法绘制直线和中点算法绘制直线、用不同的算法绘制圆和椭圆，并各自比较算法精度与效率的差别。３）实现二维图形的变换。（包括平移，放缩，旋转，错切以及复合变换）４）运用所学的区域填充算法实现区域填充。５）运用所学算法实现线段裁剪以及多边形裁剪（多边形裁剪为可选）。６）自己实现其它附加以及需要完善的功能。 -1) give system framework. 2) calls the function, some painting separately in DDA, midpoint Bresenham algorithm and improve Bresenham algorithm draws lines and the midpoint algorithm with different beeline, drawing algorithm, and each round and elliptic comparison algorithm accuracy and efficiency difference. 3) to realize the transformation of 2 d graphics. (including translation, rotation, zooming, shear and composite transform) 4) by using their area filling area filling algorithm. 5) by using their algorithm line cutting and cutting (poly cut for polygon optional). 6) in realizing additional and need to perfect function.
Date : 2025-12-16 Size : 319kb User : 元宝
[Console] zhixian DL : 0: cohen直线裁剪算法包含矩形框对线段的裁剪以及多边形的绘制-cohen linear cutting algorithm contains clipping rectangle on the line and polygon drawing
Date : 2025-12-16 Size : 2.25mb User : weng
[Console] homework_algo DL : 0: 一凸 8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T，使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一个三角形的权重是其各边的权重之和）。 -A convex polygon P 8 vertex clockwise {v1, v2, ..., v8}, any two vertices of the segment between the weights given by the matrix D. If vi and vj are not adjacent to P on two vertices, then P is a line segment vivj called chord. Find P of a chord set T, such that T in all the strings happen to the P divided into non-overlapping triangles, and each triangle weights and the minimum (a triangular weighting of their respective weights of the edges and) .
Date : 2025-12-16 Size : 4.62mb User : Eidn