摘要
本文根据图形集合运算的基本原理,提出了一种新的图形快速裁剪方法,称为“集合求交裁剪法”。这种新方法的基本思想是将图形包络区与窗口区域分别视为两个点集合,然后通过图形的求交运算即可直接求得所需要的新图形。与常用的方法(Cohen-Sutherland算法)比较,本文所提出的方法具有快速、简单的特点,并且易于推广到曲线图形的裁剪。
A new algorithm for chipping graphics rapidly based on the principleof graphic set operation is introduced in this paper.The main idea is that thegraphic area which is covered by the graphic and the window area are regarded astwo point sets then the new graphic may be obtained directly by means of thegraphic intersections.Comparing with the general algorithm:Cohen-Sutherland's,this one is rapid and simple,and can be applied to curve graphics.
出处
《计算机应用与软件》
CSCD
1991年第1期60-64,F003,F004,共7页
Computer Applications and Software
