基于工程图的连通域划分及邻接关系确定  

The Division of Connected Domains and Determination of the Neighbor Relationship based on Engineering Drawing

作　　者：刘庆保[1] 张树生[1] 范海涛[1] 

机构地区：[1]西北工业大学 现代设计与集成制造技术教育部重点实验室,西安710072

出　　处：《微处理机》2012年第4期55-58,共4页Microprocessors

基　　金：国家自然科学基金项目(51075336)

摘　　要：在基于工艺信息与工艺过程驱动的三维工序模型重建研究中,连通域的划分和邻接关系的确定是二维工序图特征识别的核心。首先采用极右路径法和极左路径法分别获得视图的最外轮廓环及各个子环;然后,通过扫描线算法确定子环之间的邻接关系;最后,根据子环及其之间的邻接关系进行连通域的划分,并进一步确定连通域之间的邻接关系。以某一零件视图为例,对该方法的有效性进行了验证。In the process of 3D process model reconstruction driven by process planning course and machining information, the division of the connected domains and the neighbor relationship between them are the key in the feature recognition based on 2D process engineering drawings. A method of ultra - right path and ultra - left path is used to obtain the max loop and each subloop： The neighbor relationship between loops is determined through the scanning line algorithm. The connected domains and their neigh- bor relationships can be derived based on the rings and their neighbor relationships. At last, an example is shown to verify the methods.

关 键 词：三维工序模型重建 特征识别 连通域 

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