Proceedings of the 20th International Meshing Roundtable 2011
DOI: 10.1007/978-3-642-24734-7_5
|View full text |Cite
|
Sign up to set email alerts
|

Isotropic 2D Quadrangle Meshing with Size and Orientation Control

Abstract: Summary. We propose an approach for automatically generating isotropic 2D quadrangle meshes from arbitrary domains with a fine control over sizing and orientation of the elements. At the heart of our algorithm is an optimization procedure that, from a coarse initial tiling of the 2D domain, enforces each of the desirable mesh quality criteria (size, shape, orientation, degree, regularity) one at a time, in an order designed not to undo previous enhancements. Our experiments demonstrate how well our resulting q… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
10
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
4
1

Relationship

1
4

Authors

Journals

citations
Cited by 5 publications
(10 citation statements)
references
References 31 publications
(46 reference statements)
0
10
0
Order By: Relevance
“…It uses a feature-dependent direction field and thus also restricts the ability of element size control. Recently, a method [Pellenard et al 2011] has been proposed for controlling the size and orientation of isotropic 2D quadrangulation that addresses the requirement of size control before orientation alignment. Because the method relies on labeling the triangles of the background triangulation through local information, it is difficult to reduce mesh singularities; furthermore, it produces results that are sensitive to the initial tessellation.…”
Section: Related Workmentioning
confidence: 99%
“…It uses a feature-dependent direction field and thus also restricts the ability of element size control. Recently, a method [Pellenard et al 2011] has been proposed for controlling the size and orientation of isotropic 2D quadrangulation that addresses the requirement of size control before orientation alignment. Because the method relies on labeling the triangles of the background triangulation through local information, it is difficult to reduce mesh singularities; furthermore, it produces results that are sensitive to the initial tessellation.…”
Section: Related Workmentioning
confidence: 99%
“…A conforming relaxation method has been recently proposed [19] to improve conformity but it also suffers from partitioning defects when employed with strongly anisotropic metrics. The inset depicts a common defect that arises when a generator with a large metric competes with a nearby generator with a small metric.…”
Section: Previous Workmentioning
confidence: 99%
“…Remind that the general set-cover problem, shown to be N P -hard, consists in finding the minimum number of subsets of a set that cover the input domain [12]. Instead of guaranteeing partitioning by construction when using, e.g., L ∞ Voronoi diagrams [16,19], we favor during optimization the absolute matching of the metric while allowing a decomposition with both overlaps and orphans. In other words, the partitioning requirement now becomes an objective function to optimize through the notion of coverage.…”
Section: Decompositionmentioning
confidence: 99%
See 2 more Smart Citations