.png){kind=icon}
Return
A progressive algorithm for block decomposition of solid models
.png){kind=icon}
PRE
AI
DOI：10.1007/s00366-021-01574-6.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
At present, the dual structure-based block decomposition methods can generally obtain relatively ideal results. However, current dual structure-based block decomposition algorithms suffer from reliability and efficiency issues. To this end, to enable them to effectively deal with complex models, this paper proposes a progressive block decomposition algorithm. The algorithm first simplifies the input model by suppressing features and decomposes the simplified model into a block structure. Then, to recover the suppressed features in the simplified model's block structure, for each suppressed feature, the algorithm generates a local model to cover the feature. After decomposing the local model into a block structure with constraints, the algorithm replaces the corresponding block set in the block structure with the local model's block structure. In this step, the block structures are refined to obtain a consistency-ensured block structure. Finally, to achieve a balance between the total number of blocks and the blocks' quality in the block structure, the algorithm optimizes the consistency-ensured block structure by simplifying the structure. Experimental results show the effectiveness of the proposed method.
Keywords:
Block decomposition
Progressive algorithm
Consistency-ensured block structure
Block structure optimization
Journal
IF:
4.9
Papers:
2.6K
Citations:
9.3K
Organization
Cited Papers
La valoración del habla bilingüe en los Estados Unidos: Fundamentos sociolingüísticos y pedagógicos en Hablando bien se entiende la gente.png)
Hispania
HispaniaIF0
PREAI
ShareSaveShareSaveShareSaveShareSave
View more