| 一种有效的任意多边形的线裁剪新算法 |
| |
| 引用本文： | 唐棣,单会秋. 一种有效的任意多边形的线裁剪新算法[J]. 计算机应用与软件, 2007, 24(1): 149-150,156 |
| |
| 作者姓名： | 唐棣 单会秋 |
| |
| 作者单位： | 辽宁师范大学计算机科学系,辽宁,大连,116029 |
| |
| 摘 要： | 根据多边形窗口各顶点与被裁剪线段的两端点分别在x轴、y轴上的坐标,首次提出窗口边界与被裁剪线段相交的必要条件,有效地排除与被裁剪线段不相交的多边形窗口边界,避免了求交带来的大量乘除法运算.算法思想简单,极大地提高了裁剪的效率.
|
| 关 键 词： | 计算机图形学 线裁剪 任意多边形 求交 任意多边形 线裁剪 算法思想 WINDOW POLYGON GENERAL LINE CLIPPING 效率 除法运算 的必要条件 线段相交 边界 多边形窗口 坐标 端点 |
| 修稿时间： | 2004-11-12 |
AN EFFICIENT LINE CLIPPING AGAINST GENERAL POLYGON WINDOW |
| |
| Tang Di,Shan Huiqiu. AN EFFICIENT LINE CLIPPING AGAINST GENERAL POLYGON WINDOW[J]. Computer Applications and Software, 2007, 24(1): 149-150,156 |
| |
| Authors: | Tang Di Shan Huiqiu |
| |
| Affiliation: | Department of Computer Science, Liaorting Normal University, Dalian Liaoning 116029, China |
| |
| Abstract: | The text brings forward the necessary condition of intersecting of line and window boundaries firstly,based the coordinates of window vertexes and end-points of line.Eliminates efficiently the window boundaries that don't intersect with the line,and averts vast operations.The algorithm idea is simple,and enhances the efficiency of clipping. |
| |
| Keywords: | Computer graphics Line clipping Arbitrary polygon Intersecting |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
