基于Python实现的图形绘制系统

灰太狼 2024-04-07 15:47 86阅读 0赞

目录  
综述 2  
算法介绍 2  
直线生成 3  
DDA算法 3  
Bresenham算法 3  
多边形的生成 6  
椭圆的生成 中点圆生成算法 6  
在实现的时候遇到的小问题 8  
曲线的生成 9  
B样条曲线 10  
图元的平移 11  
图元的旋转 11  
图元的缩放 11  
线段的裁剪 12  
Cohen-Sutherland算法 12  
Liang-Barsky 算法 13  
6. 具体的操作步骤如下: 13  
额外的一些算法 14  
2. 边表(Edge Table):所有边按下端点的y坐标归类 14  
3. 排序。如果有新边插入 AET，则对 AET 中各边排序； 16  
镜像变换 18  
系统介绍 18  
CLI 18  
GUI 18  
概述 18  
主要布局 19  
画布部分 19  
原理概述 20  
色彩笔宽部分 20  
图元操作部分 20  
线段裁剪部分 20  
重置画布部分 20  
主题部分 20  
总结 21  
参考文献 21  
B样条曲线 22  
图元的旋转 22  
Cohen-Sutherland算法 22  
扫描线算法 22  
图标 22

综述  
本实验主要为了实现一个图形绘制系统，主要内容包括了底层算法实现，命令行系统完善和图形界面系 统(pyqt)的实现;  
根据大实验的具体要求，主要通过Python3完成了以下模块的内容: 核心算法模块:cg algorithm.py(除Liang-Barsky完成)  
命令行界面程序:cg cli.py(完成)  
用户交互界面(待做)  
原理概述  
因此画布的主要使命就是:根据鼠标的位置,点击,移动,按住鼠标等事件,新建图元加入到scene()队列里面 和item\_dict字典或者更新正在工作的图元信息,然后框架就会将它绘制出来;对于选择图元进行操作的动 作则是通过selected\_id获得当前选中的图元信息,然后在item\_dict中进行检索相应的元素然后根据鼠标 事件信息对p\_list进行修改和调用algorithm里面的相应函数;  
色彩笔宽部分  
我在main\_window部分增加了笔宽和颜色对话框的接口,可以获得相应的颜色和笔宽信息同时更新到画 布类中,在画布中存储这些信息,然后在建立item的时候传进去修改QPainter的相应参数即可；  
图元操作部分  
图元操作部分为了能够便操作边显示变化,实际上就需要在mouseMoveEvent事件中进行状态的更新,而不是等结束之后再更新。我在translate,rotate,scale做的相似的操作都是使用一些中间变量记录和更新, 具体而言,在平移操作translate中,我是用self.centerx,self.centery记录当前的中心,然后传递给  
temp\_item调用translate函数更新p\_list,然后在调用getcenterpoint函数根据p\_list更新下一时刻的  
centerx,centery;在rotate里面每一次旋转实际上是要旋转当前点-中心点-上一步的点三者组成的夹角,因此我用ﬁrstx,ﬁrsty记录上一步点的信息;scale与rotate相似,需要计算的是上一步点-中心点的长度比上当前点-中心点的长度,用一个中间变量ﬁrstx,ﬁrsty同样可以解决;  
线段裁剪部分  
线段裁剪部分为了实现用来标识裁剪框的临时的矩形,我在mousePressEvent的时候建立了一个临时的  
item,并且加入到scene()队列中,这个item是Rect类型,实际上算法调用的是多边形的算法进行计算;在  
mouseMoveEvent的时候通过鼠标事件进行坐标p\_list更新,然后在mouveReleaseEvent的时候从  
scene()中删除这个图元信息即可;  
重置画布部分  
主要是将一些变量重置,初始化;这里提到的主要原因是因为一个bug,QT中listwidget变量要清除所有元素 的时候需要先将绑定的槽函数disconnect然后再执行clear()操作,否则会出现段错误,参考自博客;这个错误之前的表现是,一旦有图元移动旋转缩放过,然后重置画布,就会卡死;  
上述是5月份的版本,现在的重置画布我不再在canvas里面进行操作变量重置初始化工作,而是在  
cg\_MainWindow.py中新建了一个scene然后用setScene直接将这个新的scene绑定到canvas上面;  
主题部分  
我查阅了QT的相关文档以及多篇博客学习了QSS的使用方法,并且做了两个主题可以在菜单栏进行切换;

#!/usr/bin/env python
    # -*- coding:utf-8 -*-
    
    # 本文件只允许依赖math库
    import math
    
    
    def draw_line(p_list, algorithm):
        """绘制线段
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1]]) 线段的起点和终点坐标
        :param algorithm: (string) 绘制使用的算法，包括'DDA'和'Bresenham'，此处的'Naive'仅作为示例，测试时不会出现
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1], [x_2, y_2], ...]) 绘制结果的像素点坐标列表
        """
        temp_list_int = []
        for [x, y] in p_list:
            temp_list_int.append([round(x), round(y)])
        p_list=temp_list_int
        x0, y0 = p_list[0]
        x1, y1 = p_list[1]
        result = []
        if x0==0 and y0==0 and x1 ==0 and y1==0:
            return result
        if algorithm == 'Naive':
            if x0 == x1:
                for y in range(y0, y1 + 1):
                    result.append((x0, y))
            else:
                if x0 > x1:
                    x0, y0, x1, y1 = x1, y1, x0, y0
                k = (y1 - y0) / (x1 - x0)
                for x in range(x0, x1 + 1):
                    result.append((x, int(y0 + k * (x - x0))))
        elif algorithm == 'DDA':
            dx = x1 - x0
            dy = y1 - y0
            if (abs(dx) > abs(dy)):
                k = abs(dx)
            else:
                k = abs(dy)
            if k==0:
               result.append([x1,y1])
               return result
            delta_x = dx / k
            delta_y = dy / k
            for i in range(k + 1):
                tempx = int(x0 + i * delta_x)
                tempy = int(y0 + i * delta_y)
                result.append([tempx, tempy])
            #
            #
            # if x0 > x1:
            #     x1, x0 = x0, x1
            #     y1, y0 = y0, y1
            # dx = x1 - x0
            # dy = y1 - y0
            # k = 999999999
            # k_inf = 0
            # if dx == 0:
            #     k_inf = 1
            # else:
            #     k = dy / dx
            # x = round(x0)
            # y = round(y0)
            # '''起始点'''
            # if k > -1 and k < 1:
            #     while True:
            #         if x > x1:
            #             print("herer3")
            #             break
            #         result.append((round(x), round(y)))
            #         x = x + 1
            #         y = y + k
            # elif k >= 1:
            #     '''Y最大位移'''
            #     while True:
            #         if y > y1:
            #             print("herer1",y,y1)
            #             break
            #         result.append((round(x), round(y)))
            #         y = y + 1
            #         if k_inf == 0:
            #             x = x + 1 / k
            #         else:
            #             x = x
            # else:
            #     while True:
            #         if y < y1:
            #             print("herer2")
            #             break
            #         result.append((round(x), round(y)))
            #         y = y - 1
            #         if k_inf == 0:
            #             x = x - 1 / k
            #         else:
            #             x = x
    
            '''pass'''
            '''参考:https://www.youtube.com/watch?v=W5P8GlaEOSI
            https://blog.csdn.net/u010429424/article/details/77834046
            '''
        elif algorithm == 'Bresenham':
            if x0 > x1:
                x1, x0 = x0, x1
                y1, y0 = y0, y1
            dx = x1 - x0
            dy = y1 - y0
            f = 0
    
            if 0 <= dy <= dx:
                x = x0
                y = y0
                while x <= x1:
                    result.append((round(x), round(y)))
                    if f + dy + f + dy - dx < 0:
                        f = f + dy
                    else:
                        f = f + dy - dx
                        y = 1 + y
                    x = x + 1
            elif dy >= 0 and dy > dx:
                x = x0
                y = y0
                while y <= y1:
                    result.append((round(x), round(y)))
                    if f - dx + f - dx + dy > 0:
                        f = f - dx
                    else:
                        f = f - dx + dy
                        x = x + 1
                    y = y + 1
            elif dy <= 0 and -dy <= dx:
                x = x0
                y = y0
                while x <= x1:
                    result.append((round(x), round(y)))
                    if f + dy + f + dy + dx > 0:
                        f = f + dy
                    else:
                        f = f + dy + dx
                        y = y - 1
                    x = x + 1
            elif dy <= 0 and -dy > dx:
                x = x0
                y = y0
                while y >= y1:
                    result.append((round(x), round(y)))
                    if f + dx + f + dx + dy < 0:
                        f = f + dx
                    else:
                        f = f + dx + dy
                        x = x + 1
                    y = y - 1
    
            ''' pass'''
            '''参考:https://www.youtube.com/watch?v=RGB-wlatStc&t=415s
            https://segmentfault.com/a/1190000002700500'''
        return result
    
    
    def draw_polygon(p_list, algorithm):
        """绘制多边形
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1], [x2, y2], ...]) 多边形的顶点坐标列表
        :param algorithm: (string) 绘制使用的算法，包括'DDA'和'Bresenham'
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1], [x_2, y_2], ...]) 绘制结果的像素点坐标列表
        """
        result = []
        for i in range(len(p_list)):
            line = draw_line([p_list[i - 1], p_list[i]], algorithm)
            result += line
        return result
    
    
    def draw_ellipse(p_list):
        """绘制椭圆（采用中点圆生成算法）
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1]]) 椭圆的矩形包围框左上角和右下角顶点坐标
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1], [x_2, y_2], ...]) 绘制结果的像素点坐标列表
        """
    
        result = []
        # tempx0,tempy0=p_list[0]
        # tempx1,tempy1=p_list[1]
        # print("temp0",tempx0,tempy0)
        # print("temp1",tempx1, tempy1)
        # x0=min(tempx0,tempx1)
        # y0=max(tempy0,tempy1)
        # x1=max(tempx0,tempx1)
        # y1=min(tempy0,tempy1)
        x0, y0 = p_list[0]
        x1, y1 = p_list[1]
        if x0==x1 and y0==y1:
            result.append((x0,y0))
            return result
        if y0==y1:
            result=draw_line([[x0,y0],[x1,y1]],"DDA")
            return result
    
    
        rx = abs(x1 - x0) / 2
        ry = abs(y1 - y0) / 2
        xc = x0 + rx
        yc = y0 - ry
        p = ry * ry - rx * rx * ry + (rx * rx / 4)
    
        tx = 0
        ty = ry
        step=1
        packet = []
        #packet.append((round(tx), round(ty)))
        packet.append((tx, ty))
        # print("begin",rx,ry,xc,yc)
        while 2 * ry * ry * tx < 2 * rx * rx * ty:
            #print(tx,ty)
            #  print("left",2 * ry * ry * tx," right",2 * rx * ty)
    
            if p < 0:
                tx = tx + step
                p = p + 2 * ry * ry * tx + ry * ry
            elif p >= 0:
                tx = tx + step
                ty = ty - step
                p = p + 2 * ry * ry * tx - 2 * rx * rx * ty + ry * ry
            # print("herer")
            packet.append((tx, ty))
            # packet.append((round(tx), round(ty)))
        # print("out left", 2 * ry * ry * tx, " right", 2 * rx * ty)
        p2 = ry * ry * (tx + 0.5) * (tx + 0.5) + rx * rx * (ty - 1) * (ty - 1) - rx * rx * ry * ry
        # print("next")
        while True:
            #   print(tx, ty)
            if ty <= 0:
                '''循环到(rx,0)'''
                break
            if p2 > 0:
                ty = ty - step
                p2 = p2 - 2 * rx * rx * ty + rx * rx
                #print(p2)
            else:
                tx = tx + step
                ty = ty - step
                p2 = p2 + 2 * ry * ry * tx - 2 * rx * rx * ty + rx * rx
    
            # packet.append((round(tx), round(ty)))
            packet.append((tx, ty))
    
        for k in range(len(packet)):
            tempx, tempy = packet[k]
            result.append((round(xc + tempx), round(yc + tempy)))
            result.append((round(xc + tempx), round(yc - tempy)))
            result.append((round(xc - tempx), round(yc + tempy)))
            result.append((round(xc - tempx), round(yc - tempy)))
            # result.append((xc + tempx, yc + tempy))
            # result.append((xc + tempx, yc - tempy))
            # result.append((xc - tempx, yc + tempy))
            # result.append((xc - tempx, yc - tempy))
    
    
        return result
    
    
    ##B 样条曲线的辅助函数
    def getLambda(i, r, t, u):
        if abs(u[i + 4 - r] - u[i]) <= 1e-7:
            return 0
        else:
            return (t - u[i]) / (u[i + 4 - r] - u[i])
    
    
    def deBoorCox_X(i, r, t, p_list, u):
        tempx, tempy = p_list[i]
        # if t==2:
        #    print("r:",r)
        if r == 0:
            return tempx
        else:
            return getLambda(i, r, t, u) * deBoorCox_X(i, r - 1, t, p_list, u) + (1 - getLambda(i, r, t, u)) * deBoorCox_X(
                i - 1, r - 1, t, p_list, u)
    
    
    def deBoorCox_Y(i, r, t, p_list, u):
        tempx, tempy = p_list[i]
        if r == 0:
            return tempy
        else:
            return getLambda(i, r, t, u) * deBoorCox_Y(i, r - 1, t, p_list, u) + (1 - getLambda(i, r, t, u)) * deBoorCox_Y(
                i - 1, r - 1, t, p_list, u)
    
    
    def draw_curve(p_list, algorithm):
        """绘制曲线
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1], [x2, y2], ...]) 曲线的控制点坐标列表
        :param algorithm: (string) 绘制使用的算法，包括'Bezier'和'B-spline'（三次均匀B样条曲线，曲线不必经过首末控制点）
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1], [x_2, y_2], ...]) 绘制结果的像素点坐标列表
        """
        result = []
        q_list = []
        # print("here")
        if algorithm == 'Bezier':
            # 使用了De Casteljau’s Algorithm
            n = len(p_list)  # 次数
            # print(n)
            qy = []
            qx = []
            for i in range(len(p_list)):
                tempx, tempy = p_list[i]
                # print(tempx, tempy)
                qx.append(tempx)
                qy.append(tempy)
                # q_list.append([tempx, tempy])
    
            xarray = [0 for _ in range(n)]
            yarray = [0 for _ in range(n)]
    
            x = qx[0]
            y = qy[0]
            # print("n:",n)
            for tt in range(0, 1000 * n + 1, 1):
                t = (tt / 1000) / n
                # print(t)
                for i in range(1, n, 1):  # 迭代的次数
                    for j in range(0, n - i, 1):
    
                        if i == 1:
                            xarray[j] = qx[j] * (1 - t) + qx[j + 1] * t
                            yarray[j] = qy[j] * (1 - t) + qy[j + 1] * t
                            continue
                        else:
                            xarray[j] = xarray[j] * (1 - t) + xarray[j + 1] * t
                            yarray[j] = yarray[j] * (1 - t) + yarray[j + 1] * t
    
                q_list.append([x, y])
                x = xarray[0]
                y = yarray[0]
    
            for i in range(0, len(q_list) - 1):
                tempx0,tempy0=q_list[i]
                tempx1,tempy1=q_list[i+1]
                line=draw_line([[round(tempx0),round(tempy0)],[round(tempx1),round(tempy1)]],'DDA')
                #line = draw_line([q_list[i], q_list[i + 1]], 'DDA')
                result += line
            # pass
        elif algorithm == 'B-spline':
            k = 4
            n = len(p_list) - 1
            q_list = []
            u = [0 for _ in range(n + k + 2)]
            for i in range(0, n + k + 1 + 1, 1):
                # print(n,i)
                u[i] = i
    
            step = 0.01
            for j in range(k - 1, n + 1, 1):
                t = u[j]
                # print("j:t",j,t)
                while t <= u[j + 1]:
                    # print(t)
                    x = deBoorCox_X(j, k - 1, t, p_list, u)
                    y = deBoorCox_Y(j, k - 1, t, p_list, u)
                    q_list.append([x, y])
                    t = t + step
            for i in range(0, len(q_list) - 1):
                tempx0,tempy0=q_list[i]
                tempx1,tempy1=q_list[i+1]
                line=draw_line([[round(tempx0),round(tempy0)],[round(tempx1),round(tempy1)]],'DDA')
                # line = draw_line([q_list[i], q_list[i + 1]], 'DDA')
                result += line
    
        # 参考: Bezier: https://www.bilibili.com/video/av33675067?p=15
        # https://www.bilibili.com/video/av66548502?p=11
        # https://blog.csdn.net/Fioman/article/details/2578895
        # B样条
        # https://www.bilibili.com/video/av33675067?t=4&p=22
        # http://www.whudj.cn/?p=535
        # https://blog.csdn.net/qingcaichongchong/article/details/52797854
        # pass
        return result
    
    
    def translate(p_list, dx, dy):
        """平移变换
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1], [x2, y2], ...]) 图元参数
        :param dx: (int) 水平方向平移量
        :param dy: (int) 垂直方向平移量
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1], [x_2, y_2], ...]) 变换后的图元参数
        """
        result = []
        for [i, j] in p_list:
            #  print(i,j)
            tempx = i + dx
            tempy = j + dy
            result.append([tempx, tempy])
        return result
    
        # pass
    
    
    def rotate(p_list, x, y, r):
        """旋转变换（除椭圆外）
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1], [x2, y2], ...]) 图元参数
        :param x: (int) 旋转中心x坐标
        :param y: (int) 旋转中心y坐标
        :param r: (int) 顺时针旋转角度（°）
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1], [x_2, y_2], ...]) 变换后的图元参数
        """
        # print(math.pi);
        Pi = math.pi
        Theta = -r * Pi / 180
        result = []
        for [i, j] in p_list:
            x0 = i
            y0 = j
            tempx = x + (x0 - x) * math.cos(Theta) - (y0 - y) * math.sin(Theta)
            tempy = y + (x0 - x) * math.sin(Theta) + (y0 - y) * math.cos(Theta)
            result.append([tempx, tempy])
        return result
    
    
    # 参考：https://blog.csdn.net/LearnLHC/article/details/93623031
    # pass
    
    
    def scale(p_list, x, y, s):
        """缩放变换
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1], [x2, y2], ...]) 图元参数
        :param x: (int) 缩放中心x坐标
        :param y: (int) 缩放中心y坐标
        :param s: (float) 缩放倍数
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1], [x_2, y_2], ...]) 变换后的图元参数
        """
        result = []
    
        for [i, j] in p_list:
            qx=(i-x)*s
            qy=(j-y)*s
            tempx=qx+x
            tempy=qy+y
            result.append([tempx, tempy])
        return result
    
        # def _scale(p:list)->list:
        #     qx,qy=(p[0]-x)*s,(p[1]-y)*s
        #     return [int(qx+x),int(qy+y)]
        # return list(map(_scale,p_list))
        # pass
    
    
    def Checklocation(x, y, x_min, y_min, x_max, y_max) -> int:
        result = 0
        INSIDE = 0  # 0000
        LEFT = 1  # 0001
        RIGHT = 2  # 0010
        BOTTOM = 4  # 0100
        TOP = 8  # 1000
    
        result = INSIDE
    
        if x < x_min:
            result = result | LEFT
        elif x > x_max:
            result = result | RIGHT
        if y < y_min:
            result = result | BOTTOM
        elif y > y_max:
            result = result | TOP
        return result
    
    
    def clip(p_list, x_min, y_min, x_max, y_max, algorithm):
        """线段裁剪
    
        :param p_list: (list of list of int: [[x0, y0], [x1, y1]]) 线段的起点和终点坐标
        :param x_min: 裁剪窗口左上角x坐标
        :param y_min: 裁剪窗口左上角y坐标
        :param x_max: 裁剪窗口右下角x坐标
        :param y_max: 裁剪窗口右下角y坐标
        :param algorithm: (string) 使用的裁剪算法，包括'Cohen-Sutherland'和'Liang-Barsky'
        :return: (list of list of int: [[x_0, y_0], [x_1, y_1]]) 裁剪后线段的起点和终点坐标
        """
    
        # Cohen-Sutherland 算法
        # 参考:https://www.jianshu.com/p/d512116bbbf3
        # https://www.omegaxyz.com/2018/10/29/cohen-sutherland/
        tempx_min=min(x_min,x_max)
        tempy_min=min(y_min,y_max)
        tempx_max=max(x_max,x_min)
        tempy_max=max(y_max,y_min)
    
        x_min,y_min,x_max,y_max=tempx_min,tempy_min,tempx_max,tempy_max
        if algorithm == 'Cohen-Sutherland':
            INSIDE = 0  # 0000
            LEFT = 1  # 0001
            RIGHT = 2  # 0010
            BOTTOM = 4  # 0100
            TOP = 8  # 1000
            x0, y0 = p_list[0]
            x1, y1 = p_list[1]
            outcode0 = Checklocation(x0, y0, x_min, y_min, x_max, y_max)
            outcode1 = Checklocation(x1, y1, x_min, y_min, x_max, y_max)
            # print(x0, y0)
            # print(x1, y1)
            # print(x_max, y_max, x_min, y_min)
            pass
            # success = False
            while (1):
                # print(x1, y1, x0, y0)
                # print(outcode0, outcode1)
                if bool((outcode0 | outcode1)) == 0:
                    success = True  # 在区域里面
                    break
                elif bool(outcode0 & outcode1) == 1:  # 注意这里是位运算应该用Bool类型
                    success = False  # 不在区域里面
                    break
                else:
                    # 找到界外的点
                    x = 0
                    y = 0
                    if outcode0 == 0:
                        outcode = outcode1
                    else:
                        outcode = outcode0
                    # 找到和边界相交的点 点斜式:y-b=k(x-a)
                    # y=y0+k*(x-x0) x=x0+(1/k)*(y-y0)
    
                    if outcode & TOP:
                        rk = (x1 - x0) / (y1 - y0)
                        y = y_max
                        x = x0 + rk * (y - y0)
                    elif outcode & BOTTOM:
                        rk = (x1 - x0) / (y1 - y0)
                        y = y_min
                        x = x0 + rk * (y - y0)
                    elif outcode & RIGHT:
                        k = (y1 - y0) / (x1 - x0)
                        x = x_max
                        y = y0 + k * (x - x0)
                    elif outcode & LEFT:
                        k = (y1 - y0) / (x1 - x0)
                        x = x_min
                        y = y0 + k * (x - x0)
                    if outcode == outcode1:
                        x1 = x
                        y1 = y
                        outcode1 = Checklocation(x1, y1, x_min, y_min, x_max, y_max)
                    else:
                        x0 = x
                        y0 = y
                        outcode0 = Checklocation(x0, y0, x_min, y_min, x_max, y_max)
            if success == True:
                result = [[x0, y0], [x1, y1]]
            else:
                result = [[0, 0], [0, 0]]
            return result
        elif algorithm == 'Liang-Barsky':
            # 参考：https://blog.csdn.net/soulmeetliang/article/details/79185603
            result = []
            # p_list, x_min, y_min, x_max, y_max, algorithm
    
            x0, y0 = p_list[0]
            x1, y1 = p_list[1]
            dx = x1 - x0
            dy = y1 - y0
            p = [0 for _ in range(5)]
            q = [0 for _ in range(5)]
            p[1] = -dx
            p[2] = dx
            p[3] = -dy
            p[4] = dy
            q[1] = x0 - x_min
            q[2] = x_max - x0
            q[3] = y0 - y_min
            q[4] = y_max - y0
            success = 1
            # 初始状态:
            u1 = 0
            u2 = 1
            for i in range(1, 5, 1):
                if p[i] < 0:
                    u1 = max(u1, q[i] / p[i])
                elif p[i] > 0:
                    u2 = min(u2, q[i] / p[i])
                elif p[i] == 0 and q[i] < 0:
                    success = 0
                if u1 > u2:
                    success = 0
    
            if success == 0:
                result = [[0, 0], [0, 0]]
            else:
                x00 = x0 + u1 * dx
                y00 = y0 + u1 * dy
                x11 = x0 + u2 * dx
                y11 = y0 + u2 * dy
                result = [[x00, y00], [x11, y11]]
    
            return result
    
        # pass
    class Node:
        # 定义节点
    
        def __init__(self, data):
            self._data = data
            self._next = None
    
        def get_data(self):
            return self._data
    
        def get_next(self):
            return self._next
    
        def set_data(self, ddata):
            self._data = ddata
    
        def set_next(self, nnext):
            self._next = nnext
    class SingleLinkList:
        # 定义链表
    
        def __init__(self):
            #初始化链表为空
            self._head = None
            self._size = 0
    
        def get_head(self):
            #获取链表头
            return self._head
    
        def is_empty(self):
            #判断链表是否为空
            return self._head is None
    
        def append(self, data):
            #在链表尾部追加一个节点
            temp = Node(data)
            if self._head is None:
                self._head = temp
            else:
                node = self._head
                while node.get_next() is not None:
                    node = node.get_next()
                node.set_next(temp)
            self._size += 1
    
        def remove(self, data):
            # 在链表尾部删除一个节点
            node = self._head
            prev = None
            while node is not None:
                if node.get_data() == data:
                    if not prev:
                        # 父节点为None
                        self._head = node.get_next()
                    else:
                        prev.set_next(node.get_next())
                    break
                else:
                    prev = node
                    node = node.get_next()
            self._size -= 1
    
    #参考了https://blog.csdn.net/sinat_34686158/article/details/78745670
    
    def polifill(polygon):
    
        p_list=[]
        for x,y in polygon:
            p_list.append([round(x),round(y)])
        #整数化
        polygon=p_list
        l = len(polygon)
        result=[]
        Ymax=0
        Ymin=600
        #求最大最小边
        for [x, y] in enumerate(polygon):
            if y[1] < Ymin:
                Ymin=y[1]
            if y[1] > Ymax:
                Ymax=y[1]
        height=Ymax+2
    
    
        #初始化并建立NET表
        NET = []
        for i in range(height):
            NET.append(None)
    
    
        for i in range(Ymin, Ymax + 1):
            for j in range(0, l):
                if polygon[j][1]==i:
                    #左边顶点y是否大于y0
                    if(polygon[(j-1+l)%l][1])>polygon[j][1]:
                        [x1,y1]=polygon[(j-1+l)%l]
                        [x0,y0]=polygon[j]
                        delta_x=(x1-x0)/(y1-y0)
                        NET[i] = SingleLinkList()
                        NET[i].append([x0, delta_x, y1])
    
                    # 右边顶点y是否大于y0
                    if (polygon[(j+1+l)%l][1])>polygon[j][1]:
                        [x1, y1] = polygon[(j + 1 + l) % l]
                        [x0, y0] = polygon[j]
                        delta_x = (x1 - x0) / (y1 - y0)
                        if(NET[i] is not None):
                            NET[i].append([x0, delta_x, y1])
                        else:
                            NET[i] = SingleLinkList()
                            NET[i].append([x0, delta_x, y1])
    
    
        #建立活性边表
        AET = SingleLinkList()
        for y in range(Ymin , Ymax+1):
            # 更新 start_x
            if not AET.is_empty():
                node = AET.get_head()
                while True:
                    [start_x,delta_x,ymax] = node.get_data()
                    start_x += delta_x
                    node.set_data([start_x,delta_x,ymax])
                    node = node.get_next()
                    if node is None:
                        break
    
            # 填充
            if not AET.is_empty():
                node = AET.get_head()
                x_list = []
                # 获取所有交点的x坐标
                while True:
                    [start_x,_,_] = node.get_data()
                    x_list.append(start_x)
                    node = node.get_next()
                    if node is None:
                        break
    
                # 排序
                x_list.sort()
                #print(x_list)
                # 两两配对填充
                for i in range(0,len(x_list),2):
                    x1 = x_list[i]
                    x2 = x_list[i+1]
                    for pixel in range(int(x1),int(x2)+1):
                        #image[y][pixel] = color
                        result.append([pixel,y])
    
            if not AET.is_empty():
                # 删除非活性边
                node = AET.get_head()
                while True:
                    [start_x,delta_x,ymax] = node.get_data()
                    if ymax == y:
                        AET.remove([start_x,delta_x,ymax])
                    node = node.get_next()
                    if node is None:
                        break
    
            # 添加活性边
            if NET[y] is not None:
                node = NET[y].get_head()
                while True:
                    AET.append(node.get_data())
                    node = node.get_next()
                    if node is None:
                        break
    
    
        return result
    
    
    def encode(x,y,XL,XR,YB,YT):
        LEFT = 1  # 0001 左
        RIGHT = 2  # 0010 右
        BOTTOM = 4  # 0100 下
        TOP = 8  # 1000 上
        c=0
    
        if(x<XL):
            c=c|LEFT
        if(x>XR):
            c= c|RIGHT
        if(y<YB):
            c= c|BOTTOM
        if(y>YT):
            c=c|TOP
        return c
    
    
    def draw_polygon_cut(polygon,XL,XR,YB,YT):
        #参考了https://blog.csdn.net/sinat_34686158/article/details/78745216
        LEFT = 1  # 0001 左
        RIGHT = 2  # 0010 右
        BOTTOM = 4  # 0100 下
        TOP = 8  # 1000 上
        #image=image
        result=[]
        xmin,xmax=min(XL,XR),max(XL,XR)
        ymin,ymax=min(YB,YT),max(YB,YT)
        XL,XR,YB,YT=xmin,xmax,ymin,ymax
    
        l = len(polygon)
        for i in range(l):
            [x1, y1] = polygon[i]
            [x2, y2] = polygon[(i + 1 + l) % l]
    
            flag=0
            code1=encode(x1,y1,XL,XR,YB,YT)
            code2=encode(x2,y2,XL,XR,YB,YT)
            while(code1!=0 or code2!=0):        #同时为0,在内部，不用裁剪
                if(code1 & code2 !=0):
                    flag=1
                    break
                if(code1!=0):
                    code=code1
                else:
                    code=code2
                if(LEFT & code!=0):      #点在线左边
                     x=XL
                     if(x1==x2):
                         y=y1
                     else:
                         y=(int)(y1+(y2-y1)*(XL-x1)/(x2-x1))
                elif(RIGHT & code!=0):   #点在线右边
                    x = XR
                    if(x2==x1):
                        y=y1
                    else:
                        y = (int)(y1 + (y2 - y1) * (XR - x1) / (x2 - x1))
                elif (BOTTOM & code != 0):     #点在线下边
                    y = YB
                    if(y2==y1):
                        x=x1
                    else:
                        x = (int)(x1 + (x2 - x1) * (YB - y1) / (y2 - y1))
                elif (TOP & code != 0):     #点在线上边
                    y = YT
                    if(y2==y1):
                        x=x1
                    else:
                        x = (int)(x1 + (x2 - x1) * (YT - y1) / (y2 - y1))
                if(code==code1):
                    x1=x
                    y1=y
                    code1=encode(x,y,XL,XR,YB,YT)
                else:
                    x2=x
                    y2=y
                    code2=encode(x,y,XL,XR,YB,YT)
    
            if(flag==1):
                pass
            else:
                if(x1 > x2):
                    temp = x2
                    x2 = x1
                    x1 = temp
                    temp = y2
                    y2 = y1
                    y1 = temp
    
                #DDALine(image, x1, y1, x2, y2, False)
                p_list=[]
                p_list.append([x1,y1])
                p_list.append([x2,y2])
                line=draw_line(p_list,'DDA')
                result+=line
        return result
    def x_mirror(p_list,centery):
    
        #对称轴:
        ymid=centery
        #a-x=x-b
        #ynew-ymid=ymid-y
        #ynew=2ymid-y
        #
        result=[]
        for x,y in p_list:
            #tempy=y
            tempy=2*ymid-y
            tempx=x
            result.append([tempx,tempy])
        return result
    def y_mirror(p_list,centerx):
        xmid=centerx
        result=[]
        for x,y in p_list:
            tempy=y
            tempx=2*xmid-x
            result.append([tempx,tempy])
        return result

![在这里插入图片描述][96463f41362a4ace9fc4e98d3cf318b7.png_pic_center]  
![在这里插入图片描述][dabbb42127414e6a94a1125a6344d24f.png_pic_center]  
![在这里插入图片描述][6e010377806a4a69bdcfaf311e70661e.png_pic_center]  
![在这里插入图片描述][dd3c58141ef745bbbf1727ae7fc3ae37.png_pic_center]  
![在这里插入图片描述][50733616ff4942d1b1a629442e94fac5.png_pic_center]  
![在这里插入图片描述][ee14d507414a452992bd12ab12690cb5.png_pic_center]  
![在这里插入图片描述][7bca66ea3d864aaabb6e447dcb08e3c3.png_pic_center]  
![在这里插入图片描述][5c3bba1d0e8e444ea5ec81da2c0f9d01.png_pic_center]  
![在这里插入图片描述][afed0d77e451460c9261ea37169297cd.png_pic_center]  
![在这里插入图片描述][672963880dcd4550ad9d72b66e6e49d8.png_pic_center]  
![在这里插入图片描述][3f90b12fb1014b758b848c1caf9c3c07.png_pic_center]  
![在这里插入图片描述][e3dd83a960e94c3a8ead41fc7bad607c.png_pic_center]  
![在这里插入图片描述][a71d404ac42840b788ea86c01726492c.png_pic_center]  
![在这里插入图片描述][d5899ba36576480cada6d2ab269756bc.png_pic_center]  
![在这里插入图片描述][3f03f17e95514333ae5c64329b438ba9.png_pic_center]  
![在这里插入图片描述][4e2b4b0ef4994aeaa9d8bd1754fe8498.png_pic_center]  
![在这里插入图片描述][0304de408a2b43a8b59dbe39360edba7.png_pic_center]  
![在这里插入图片描述][759a7cd4354e4bc3992a05303edddc77.png_pic_center]  
![在这里插入图片描述][042985fc177c4ba2bfe0f8843f9e9a00.png_pic_center]  
![在这里插入图片描述][2715421077d14595b7c2d3d3ac5cccec.png_pic_center]  
![在这里插入图片描述][bba3f61dd759476b968e500dfc2b3dc1.png_pic_center]  
![在这里插入图片描述][d33a99d8da814cb1a10b333c4dee8f2a.png_pic_center]  
![在这里插入图片描述][c263670ffd774608ab2e30c34730a101.png_pic_center]  
![在这里插入图片描述][dd81625ee7234d6486079274b70e17e3.png_pic_center]  
![在这里插入图片描述][be71a7a6a5d24e9390d398c03177a352.png_pic_center]  
![在这里插入图片描述][e7861745a0d1486aa03b33c495900948.png_pic_center]

[96463f41362a4ace9fc4e98d3cf318b7.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/528d8adbe3a14afca4f4216b2e44b4ff.png
[dabbb42127414e6a94a1125a6344d24f.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/66795af97f824843bf8e35bd9394e930.png
[6e010377806a4a69bdcfaf311e70661e.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/df33a82317054245b17b45f7b1dabef6.png
[dd3c58141ef745bbbf1727ae7fc3ae37.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/7f22066923ec4c5b8291d17fe2d3460b.png
[50733616ff4942d1b1a629442e94fac5.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/7e6ddf445e1e43f3a28577cb21c6f875.png
[ee14d507414a452992bd12ab12690cb5.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/3657fe29374e40d4a41b58b1cdc24d7c.png
[7bca66ea3d864aaabb6e447dcb08e3c3.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/1b1a9607660a4401a66283c9450f9c0b.png
[5c3bba1d0e8e444ea5ec81da2c0f9d01.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/c3d966c4ab8646a1864c7d0a394d8a58.png
[afed0d77e451460c9261ea37169297cd.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/9886cc4d61854c4c82d6f5952e227fb6.png
[672963880dcd4550ad9d72b66e6e49d8.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/19bf2af8c2854ccab46b9db4f9eb79c7.png
[3f90b12fb1014b758b848c1caf9c3c07.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/5614c4752aef4de792313b3f1c7d46d8.png
[e3dd83a960e94c3a8ead41fc7bad607c.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/b7143196e1a741468bc19a6edef13ef2.png
[a71d404ac42840b788ea86c01726492c.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/2d49e5f155684a1e84f6b7b58eee3244.png
[d5899ba36576480cada6d2ab269756bc.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/f4b82ef4033f44b28f0b325144ea2173.png
[3f03f17e95514333ae5c64329b438ba9.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/ce59840c8cd24b10a2a57461f67e2f1b.png
[4e2b4b0ef4994aeaa9d8bd1754fe8498.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/bc29ffb7d1604cc2bd416772d8dfe086.png
[0304de408a2b43a8b59dbe39360edba7.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/dee6ae99ca7545d6b7cc4b2666637947.png
[759a7cd4354e4bc3992a05303edddc77.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/31c93a7e581e4dd389d6e5fcdac3667c.png
[042985fc177c4ba2bfe0f8843f9e9a00.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/77d0d80aa1394bdaab3dedb501c77e38.png
[2715421077d14595b7c2d3d3ac5cccec.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/7e065e8c1c3a46558f1c04bc4d7cae8d.png
[bba3f61dd759476b968e500dfc2b3dc1.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/346ee5bf5e8a44a8a727076c21624354.png
[d33a99d8da814cb1a10b333c4dee8f2a.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/becaf587979e4f168e2dac050b0f16f5.png
[c263670ffd774608ab2e30c34730a101.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/1868a4dc80f84b9583ce9eed1ec8586b.png
[dd81625ee7234d6486079274b70e17e3.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/8e9d5c3b5dcc46e99745575ea13c0d33.png
[be71a7a6a5d24e9390d398c03177a352.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/fce09dba019b4a2b879b642b5c1b79ba.png
[e7861745a0d1486aa03b33c495900948.png_pic_center]: https://image.dandelioncloud.cn/pgy_files/images/2024/04/07/e257517ee74d477d8b8f61de0938d7b0.png