CAD中封闭区域的并、交、差运算  

UNION,INTERSECTION AND TRIM OPERATIONS OF THE CLOSED REGIONS IN CAD

作　　者：李旭健[1] 韩丛英[1] 张军[2] 房胜[1] 

机构地区：[1]山东科技大学 信息科学与工程学院,山东青岛266510 [2]山东农业大学园艺学院,山东泰安271018

出　　处：《山东农业大学学报（自然科学版）》2006年第3期416-418,共3页Journal of Shandong Agricultural University：Natural Science Edition

基　　金：国家自然科学基金(70371052)

摘　　要：区域运算在CAD中普遍存在,并且是系统效率的一个瓶颈。本文提出了一种基于交点的凹凸性求封闭区域的并、交、差的算法。首先给出了环、并、交、差、凹凸点的定义；然后描述了算法。该算法的特点是思路简捷,并适合于任意封闭区域。The region operation occurs conmisong in CAD generally, and is a bottleneck of system efficiency. This paper proposes an algorithm for union, intersection and trim of the closed region, which is based on convex--concave points. The paper detined the loop, union, intersection, trim and convex-concave point and then presents the algorithm, which is simple and suits for any closed regions.

关 键 词：封闭区域 环 并 交 差 凹凸点 CAD 

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