2022
DOI: 10.1007/s00366-021-01574-6
|View full text |Cite
|
Sign up to set email alerts
|

A progressive algorithm for block decomposition of solid models

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 40 publications
0
1
0
Order By: Relevance
“…Compared with unstructured meshes, structured meshes have the characteristics of high solution accuracy and fewer required elements [1]. However, due to the strong topological constraints of structured meshes, generating high-quality structured meshes for complex geometric models is nontrivial; it often requires a lot of manual work and high expertise from users [3][4][5][6][7][8][9]. An alternative way is to decompose the domain covered by the geometric model into several four-sided sub-domains and then generate structured meshes in each sub-domain.…”
Section: Introductionmentioning
confidence: 99%
“…Compared with unstructured meshes, structured meshes have the characteristics of high solution accuracy and fewer required elements [1]. However, due to the strong topological constraints of structured meshes, generating high-quality structured meshes for complex geometric models is nontrivial; it often requires a lot of manual work and high expertise from users [3][4][5][6][7][8][9]. An alternative way is to decompose the domain covered by the geometric model into several four-sided sub-domains and then generate structured meshes in each sub-domain.…”
Section: Introductionmentioning
confidence: 99%