计算机图学的一种裁剪法

图形的裁剪法已有多种并且均用得很成功，主要目的之一是减少计算量，根据一个点位于一条 段的左或右方的判定可导出一种较简单的算法．本文据此提出一种计算量较少的线段和多边形间 的裁剪法，有关多边形既有凸的也有凹的，同时提供了已用计算机执行过的两个例子。

A CLIPPING METHOD FOR COMPUTER GRAPHICS

Many methods for graphic clipping have been developed and succcssfully used. One of the main problems under research is how to decrease the com- putational quantities. By basing on the selection of the locations of a point relative to the line, i. e. whether a point lies on the left or on the right side of the line, a simple algorithm can be derived. In this paper there presents a method with fewer calculations for clipping a polygon into a line or vice versa. The two kinds of polygons, concave and convex, are considered and two examples are given, which run well on the computer.