基于一般多边形窗口的线裁剪  

Line Clipping Based on General Polygons

作　　者：韩明峰[1] 

机构地区：[1]山东工业大学计算机科学与技术系

出　　处：《微机发展》1999年第2期48-49,共2页Microcomputer Development

摘　　要：基于一般多边形窗口的线裁剪在计算机图形学中有着广泛的、重要的应用。本文针对传统算法存在着分类过细、运算量大的不足，提出了一种交点选择方法，使得裁剪问题变得简单易行。经实验证明该算法是高效的、正确的。The Line Cliping based on gene ral polygons is important and widely used in computer graphics. The traditional algorithm is very complex and needs much calculation, so a way to chose the int ersections is presented in this paper, which makes the clipping problem easily. The experience has proved that the algorithm is correct.

关 键 词：计算机图形学 线裁剪 算法 多边形窗口 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]