一种快速的多边形的线裁剪算法  

Rapid Algorithm on the Edge Clipping of General Polygons

作　　者：沈自林[1] 沈庆云[1] 范彦斌[1] 

机构地区：[1]佛山科学技术学院思源机电一体化研究所,广东佛山528000

出　　处：《机械设计与制造工程》2002年第4期58-59,共2页Machine Design and Manufacturing Engineering

摘　　要：裁剪算法是计算机图形学的一个基本算法 ,但大多数算法都是针对矩形窗口或多边形窗口的 ,已有的凹多边形裁剪主要将其分解为凸多边形处理。此外提出一个任意多边形的快速交点排序线裁剪算法 。Clipping algorithms were one of the most fundamental ways in computer graphics. Most algorithms were used to deal with rectangular windows and convex polygons. Concave polygons had to be divided into several convex polygons. It described a clipping algorithm for general polygons, this could be used for 2D removing hidden edges of parts assembly drawing.

关 键 词：多边形 裁剪 消隐 算法 计算机图形学 

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