摘要
线段裁剪是计算机图形学需要解决的基本问题之一。在对常见的线段裁剪算法分析的基础上,针对Cohen-Sutherland算法的改进进行了探索。利用合理构造分割窗口的辅助线,实现线段和窗口间位置关系的更精确判断,避免了无效交点的计算,提高了裁剪算法的整体效率。改进思路也同样适用于其他的裁剪算法。
Segment cliping algorithm is one of the most fundamental ways in computer graphics. The improvement of Cohen-Sutherland algorithm is proposed on the analysis of common segment cliping algorithm in this paper. Some assistant lines are created to partition to the clipping window, then according to the feature of the area which the clipped segment belongs to, the relationship of the location between the segment and the window can be distinguished well and truly. So the caculation of the cross-points is performed only when it is needed. This means a faster clipping agorithm. And the idea in the paper would hold true for other clipping agorithm.
出处
《计算机应用与软件》
CSCD
北大核心
2006年第7期113-114,共2页
Computer Applications and Software
关键词
计算讥图形学
线段裁剪
算法
Computer graphics Segment cliping Algorithm
