An automatic and general least-squares projection procedure for sweep meshing

10Citations
Citations of this article
10Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we present a new node projection scheme to generate hexahedral meshes in sweeping geometries. It is based on a least-squares approximation of an affine mapping. In the last decade several functionals have been defined to perform this least-square approximation. However, all of them present several shortcomings in preserving the shape of the inner part of the projected meshes, i.e. the offset data, for simple and usual geometrical configurations. To overcome these drawbacks we propose to minimize a more general functional that depends on two vector parameters. Moreover, we detail a procedure that automatically selects these parameters in such a way that offset data is maintained in the inner part of projected meshes. © 2006 Springer.

Cite

CITATION STYLE

APA

Roca, X., & Sarrate, J. (2006). An automatic and general least-squares projection procedure for sweep meshing. In Proceedings of the 15th International Meshing Roundtable, IMR 2006 (pp. 487–506). https://doi.org/10.1007/978-3-540-34958-7_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free