Show simple item record

dc.contributor.authorRuiz-Gironés, Eloi
dc.contributor.authorRoca Navarro, Francisco Javier
dc.contributor.authorSarrate Ramos, Josep
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtica Aplicada III
dc.date.accessioned2010-05-25T14:50:45Z
dc.date.available2010-05-25T14:50:45Z
dc.date.created2009-10-25
dc.date.issued2009-10-25
dc.identifier.citationRuiz, E.; Roca, F.; Sarrate, J. A new procedure to compute imprints in multi-sweeping algorithms. A: International Meshing Roundtable. "18th International Meshing Roundtable". Salt Lake City: 2009, p. 281-299.
dc.identifier.isbn978-3-540-87920-6
dc.identifier.urihttp://hdl.handle.net/2117/7377
dc.description.abstractOne of the most widely used algorithms to generate hexahedral meshes in extrusion volumes with several source and target surfaces is the multi-sweeping method. However, the multi-sweeping method is highly dependent on the final location of the nodes created during the decomposition process. Moreover, inaccurate location of inner nodes may generate erroneous imprints of the geometry surfaces such that a final mesh could not be generated. In this work, we present a new procedure to decompose the geometry in many-to-one sweepable volumes. The decomposition is based on a least-squares approximation of affine mappings defined between the loops of nodes that bound the sweep levels. In addition, we introduce the concept of computational domain, in which every sweep level is planar. We use this planar representation for two purposes. On the one hand, we use it to perform all the imprints between surfaces. Since the computational domain is planar, the robustness of the imprinting process is increased. On the other hand, the computational domain is also used to compute the projection onto source surfaces. Finally, the location of the inner nodes created during the decomposition process is computed by averaging the locations computed projecting from target and source surfaces.
dc.format.extent19 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística::Anàlisi numèrica::Mètodes en elements finits
dc.subject.lcshFinite element method
dc.subject.lcshNumerical grid generation
dc.subject.otherFinite element method Mesh generation Hexahedral mesh Multisweeping Computational domain
dc.titleA new procedure to compute imprints in multi-sweeping algorithms
dc.typeConference report
dc.subject.lemacElements finits, Mètode dels
dc.contributor.groupUniversitat Politècnica de Catalunya. LACÀN - Mètodes Numèrics en Ciències Aplicades i Enginyeria
dc.rights.accessOpen Access
local.identifier.drac2454207
dc.description.versionPostprint (published version)
local.citation.authorRuiz, E.; Roca, F.; Sarrate, J.
local.citation.contributorInternational Meshing Roundtable
local.citation.pubplaceSalt Lake City
local.citation.publicationName18th International Meshing Roundtable
local.citation.startingPage281
local.citation.endingPage299


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record