Block decomposition techniques in the generation of adaptive grids

Authors:
Nadaniela Egidi;Pierluigi Maponi
Affiliations:
Dipartimento di Matematica e Informatica, Universití di Camerino, 62032 Camerino (MC), Italy;Dipartimento di Matematica e Informatica, Universití di Camerino, 62032 Camerino (MC), Italy
Venue:
Mathematics and Computers in Simulation
Year:
2008

Citing 3
Cited 2

Geometric modeling

Geometric modeling
A Characterization of the Quadrilateral Meshes of a Surface Which Admit a Compatible Hexahedral Mesh of the Enclosed Volume

STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A class of network optimization methods for planar grid generation

Applied Numerical Mathematics

An active set strategy to generate quadrilateral grids

Journal of Computational and Applied Mathematics
On the design of an obstacle avoiding trajectory: Method and simulation

Mathematics and Computers in Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of the generation of adaptive grids, where, for a given domain @W, we have to compute a partition that depends on a given map f providing the desired local mesh size. We propose a numerical method for the solution of this problem in the case of planar quadrilateral grids. In particular, a block decomposition method is proposed, by which @W is first decomposed in several blocks depending on the shape of the domain and on the size map f, and then the whole grid is obtained as the union of the quadrilateral grids on each block. The algorithm concludes with a smoothing step that depends on the size map f. We present some simple numerical examples to test the proposed method.