摘要： 读文研究并提出了一种凸多边形的裁剪算法，它不同于传统的多边形裁剪算法，仅需对视口之外顶点所关税的边检查与视口的相交性。裁剪速度快，简单易行。

关键词: 凸多边形, 视口, 修剪, 算法

Abstract: This paper studies and gives a clipping algorithms of convex polygons. It discusses only the intersections between window and the edge that one of its vertices is out of window. And it has a speedy effect.

中图分类号: 

• TP391.4