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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
1. Thompson JF, Soni B, Weatherill N Handbook of Grid Generation. CRC Press, 1999.
2. Owen SJ (1998) A survey of unstructured mesh generation technology. In: 7th Int Meshing Roundtable 239–267.
3. Blacker T (1996) The Cooper Tool. In: 5th Int Meshing Roundtable 13–30.
4. Mingwu L, Benzley SE (1996) A multiple source and target sweeping method for generating all-hexahedral finite element meshes. In: 5th Int Meshing Roundtable 217–225.
5. Knupp PM (1998) Next-generation sweep tool: a method for generating allhex meshes on two-and-one-half dimensional geometries. In: 7th Int Meshing Roundtable 505–513.
6. Staten ML, Canann SA, Owen SJ (1999) BMSweep: Locating interior nodes during sweeping. Eng Comput 15:212–218.
7. Scott MA, Earp MA, Benzley SE, Stephenson MB (2004) Adaptive Sweeping Techniques. In: 14th Int Meshing Roundtable 417–432.
8. White DR, Saigal S, Owen SJ (2004) CCSweep: automatic decomposition of multi-sweep volumes. Eng Comput 20:222–236.
9. Roca X., Sarrate J. Huerta A (2005) A new least-squares approximation of affine mappings for sweep algorithms. In: 14th Int Meshing Roundtable 433–448.
10. Gill PE, Murray W, Wright MH (1991) Numerical Linear Algebra and Optimization. Addison-Wesley, Edwood City.
11. Lawson C, Hanson R (1974) Solving Least Squares Problems. Prentice-Hall, Englewood Clifs.
12. Roca X, Sarrate J, Huerta A (2004) Surface mesh projection for hexahedral mesh generation by sweeping. In: 13th Int Meshing Roundtable 169–179.
13. Knupp PM (2004) Algebraic mesh quality metrics for unstructured initial meshes. Finite Elem Anal Des 39:217241.
14. Tautges TJ, White DR and Leland RW (2004) Twelve ways to fool the masses when describing mesh generation performance. In: 13th Int Meshing Roundtable 181–190.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Roca, X., Sarrate, J. (2006). An Automatic and General Least-Squares Projection Procedure for Sweep Meshing. In: Pébay, P.P. (eds) Proceedings of the 15th International Meshing Roundtable. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-34958-7_28
Download citation
DOI: https://doi.org/10.1007/978-3-540-34958-7_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34957-0
Online ISBN: 978-3-540-34958-7
eBook Packages: EngineeringEngineering (R0)