| 基于裁剪窗口顶点和对角线的二维线段快速裁剪算法 |
| |
| 引用本文： | 肖昕,冯菁. 基于裁剪窗口顶点和对角线的二维线段快速裁剪算法[J]. 计算机与数字工程, 2004, 32(4): 29-31 |
| |
| 作者姓名： | 肖昕 冯菁 |
| |
| 作者单位： | 华南师范大学计算机系,广州,510631;湖南省祁阳县黄泥塘镇中心学校,祁阳,426161 |
| |
| 摘 要： | 根据二维线段与矩形窗口顶点和对角线的位置关系，介绍一种二维线段的矩形窗口裁剪算法，以减少裁剪求交的次数，从而减少算法的运算量，达到快速裁剪线段的目的。
|
| 关 键 词： | 线段 裁剪 矩形窗口 计算机图形学 |
| 修稿时间： | 2004-04-20 |
A Speedy Algorithm of 2-D Line Segment Based on Clipping Window's Vertexes and Diagonals |
| |
| Xiao Xin Feng Jing. A Speedy Algorithm of 2-D Line Segment Based on Clipping Window's Vertexes and Diagonals[J]. Computer and Digital Engineering, 2004, 32(4): 29-31 |
| |
| Authors: | Xiao Xin Feng Jing |
| |
| Abstract: | On the basis of relations between 2-D line segment with rectangle window's vertexes, diagonals and margins, a new 2-D line clipping algorithm with the least arithmetic operations is presented. .This algorithm is simple, clearly thinking in programming and speedy in calculating. |
| |
| Keywords: | line segment clipping rectangle window computer graphics |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
