检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]解放军后勤工程学院 [2]解放军73808部队
出 处:《计算机与现代化》2011年第1期117-120,共4页Computer and Modernization
摘 要:基于新边表出现在有顶点的扫描线上这一特性,提出由顶点y坐标划分扫描线范围和确定活性边表更新的多边形扫描转换算法,该算法避免了对每条扫描线都进行判别。提出确定前后顶点序号的通用算法和通过顶点坐标建立新边表并将新边表与顶点y坐标进行关联的算法。列表比较两种算法的运算步骤,实例运行结果说明新算法具有结构简洁、阅读方便、运行稳定和执行速度快等优点。Based on the characteristic of new edge tables existing only in the scan line through the vertex, a new polygon scanning conversion algorithm is proposed in which scan range is divided and active edge table is updated by the y coordinate of vertex of polygon. The algorithm avoids the redundant identification operation to each scan line in the sorted edge table method. It is proposed the general algorithm of determined the serial number for front and back the apex and the general algorithm of creating a new edge table and the new edge table associated with of the y coordinates of apex. The steps of the algorithm are compared in a table. The result shows that the new algorithm has many advantages such as simple structure, easy to read, stable operation and fast implementation, etc.
分 类 号:TP301[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173