2005
DOI: 10.1007/s00366-005-0317-7
|View full text |Cite
|
Sign up to set email alerts
|

Generation of anisotropic mesh by ellipse packing over an unbounded domain

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2009
2009
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 9 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…An equivalent 'metric-based' advancing front surface mesh generation algorithms is presented by Cuilliere in [44]. A more exotic metric-based approach based on packing ellipses has been devised by Yamada and coworkers [45] and has been used more recently by Lo and Wang in [46].…”
Section: -D Mesh Generationmentioning
confidence: 98%
“…An equivalent 'metric-based' advancing front surface mesh generation algorithms is presented by Cuilliere in [44]. A more exotic metric-based approach based on packing ellipses has been devised by Yamada and coworkers [45] and has been used more recently by Lo and Wang in [46].…”
Section: -D Mesh Generationmentioning
confidence: 98%
“…The second stage involves optimizing boundary mesh by remeshing the surface mesh partly. The ball-packing method (Lo and Wang, 2005b, Yamakawa and Shimada, 2003; Liu et al , 2008) and the node insertion/deletion method (Greg, 2001) are combined in this stage, and the results show that this approach is efficient and can generate high-quality meshes. The third stage involves remeshing some portions of the volume mesh by combining the ball-packing method and the Delaunay mesh generation method.…”
Section: Overall Methodsmentioning
confidence: 99%