An Approach to the Automatic Recognition of Boolean Decomposition Loops for Swept Volume Decomposition
Zhang, Yingzhong, Xiaofang Luo, Yong Zhao
Research Note, 25th International Meshing Roundtable, Sandia National Laboratories, September 26-30 2016
25th International Meshing Roundtable
Washington DC, U.S.A.
September 26-30, 2016
Yingzhong Zhang, Dalian University of Technology, CN, email@example.com
Xiaofang Luo, Dalian University of Technology, CN, firstname.lastname@example.org
Yong Zhao, Dalian University of Technology, CN, email@example.com
Research Note Abstract
Hexahedral meshing needs to perform volume decomposition that decomposes a complex shape into simple hex meshable sub-domains, which is a very time-consuming and experience needed work. It is necessary to research and develop intelligent swept volume decomposition approaches. The fundamental work of the decomposition approaches based on swept features is to recognize the decomposition loops from the complex traces resulting from interactions among swept features. In this paper, an intelligent approach to the automatic recognition of Boolean decomposition loops is presented. This approach first constructs a feature vertex adjacent graph of the part model to be decomposed, and then implements searching for the nodes of decomposition loops. In the searching processes, the initial node selection, the node growth, the reconstruction simulations and evaluation, and feedback operations are employed. This work lays the foundation for the subsequent swept volume decomposition.
Download Full Paper (PDF)
Contact author(s) or publisher for availability and copyright information on above referenced article