投审稿平台


投稿指南
下载专区
地  址:北京市海淀区中关村科学院
南路6号中国科学院计算所342号 [地图]
《计算机辅助设计与图形学学报》编辑部
邮政编码:100190
电  话:010-62562491
          010-62600342
订阅信息
ISSN      1003-9775
CN        11-2925/TP
邮发代号:82-456
单    价:80.00元
全年订价:960.00元
在线期刊

边界模型布尔分割环自动识别

张应中, 罗晓芳, 赵 永
(大连理工大学机械工程学院 大连 116024)
分类号: TP391.41
出版年,卷(期):页码: 2017 , 29 ( 7 ): 1356-1364 张应中
摘要: 布尔分割环是设计特征在边界模型上造型的痕迹, 其自动识别是后续设计特征自动重构的基础. 在对特征造型过程形状演化分析基础上, 提出一种布尔分割环几何表示和自动识别构建方法. 首先依据边界的凹凸特性及顶点的邻接特性构建边界模型的特征顶点邻接图, 并对邻接图开展顶点节点树搜索; 然后将搜索方法分为初始节点选择、节点增长、搜索评估和反向传播4个步骤, 在节点增长步骤中, 采用相邻节点到特征面距离最小判定方法及顶点虚拟邻接构成伪边的方法, 实现分割环的封闭和特征面的有效分割. 实例结果表明, 该方法能够从复杂特征相交形成的交线中自动识别和构造出布尔分割环.
关键词: 设计特征; 边界模型; 分割环; 顶点邻接图; 顶点搜索
Automatic Recognition of Boolean Segmentation Loops for B-Rep Models
Zhang Yingzhong, Luo Xiaofang, and Zhao Yong
(School of Mechanical Engineering, Dalian University of Technology, Dalian 116024)
abstract: Boolean segmentation loops are the traces of design features modeled on B-rep models, and their automatic recognition is the foundation for the subsequent reconstruction of design features. Based on the shape evolution analysis of the part models in the feature-based modelling process, an approach to automatic recognition for Boolean segmentation loops is presented. This approach first constructs a feature vertex adjacent graph of the part model to be reconstructed according to the convex-and-concave properties of geometric edges and the adjacency properties of geometric vertexes, and implements searching for the vertex node of segmentation loops. Then, the search procedure is divided into four steps, namely the initial node selection, the node growth, searching evaluation, and feedback operations. In the node growth step, a decision method in terms of the minimum distance to the feature surface and a method of forming pseudo edges by virtually linking adjacency vertexes are employed, which can ensure the segmenting loop closed. The experimental results show that this method can automatically recognize Boolean segmentation loops from the complex intersecting edges formed by intersection of design features.
keyword: design feature; B-rep model; segmentation loop; vertex adjacent graph; vertex searching
 
Copyright © 2004《计算机辅助设计与图形学学报》版权所有
电话:010-62600342 传真:010-62562491
E_mail:jcad@ict.ac.cn