2017
DOI: 10.1155/2017/2953736
|View full text |Cite
|
Sign up to set email alerts
|

An Iterative Mesh Untangling Algorithm Using Edge Flip

Abstract: Existing mesh untangling algorithms are unable to untangle highly tangled meshes. In this study, we address this problem by proposing an iterative mesh untangling algorithm using edge flip. Our goal is to produce meshes with no inverted elements and good element qualities when inverted elements with poor element qualities are produced during mesh generation or mesh deformation process. Our proposed algorithm is composed of three steps: first, we iteratively perform edge flip; subsequently, optimizationbased me… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Inverted elements should be eliminated before carrying out numerical simulations, since they usually produce invalid solutions [14]. There are many methods for eliminating inverted elements, including remeshing [15], local mesh modification [16], topological transformations [17] and mesh smoothing. Remeshing may not be automatic, especially for models with complex geometries.…”
Section: Introductionmentioning
confidence: 99%
“…Inverted elements should be eliminated before carrying out numerical simulations, since they usually produce invalid solutions [14]. There are many methods for eliminating inverted elements, including remeshing [15], local mesh modification [16], topological transformations [17] and mesh smoothing. Remeshing may not be automatic, especially for models with complex geometries.…”
Section: Introductionmentioning
confidence: 99%