Ir al contenido (pulsa Retorno)

Universitat Politècnica de Catalunya

    • Català
    • Castellano
    • English
    • LoginRegisterLog in (no UPC users)
  • mailContact Us
  • world English 
    • Català
    • Castellano
    • English
  • userLogin   
      LoginRegisterLog in (no UPC users)

UPCommons. Global access to UPC knowledge

Banner header
61.607 UPC E-Prints
You are here:
View Item 
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Matemàtiques
  • Ponències/Comunicacions de congressos
  • View Item
  •   DSpace Home
  • E-prints
  • Departaments
  • Departament de Matemàtiques
  • Ponències/Comunicacions de congressos
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

A new procedure to compute imprints in multi-sweeping algorithms

Thumbnail
View/Open
A new procedure.pdf (996,6Kb)
  View Usage Statistics
  LA Referencia / Recolecta stats
Cita com:
hdl:2117/7377

Show full item record
Ruiz-Gironés, Eloi
Roca Navarro, Francisco Javier
Sarrate Ramos, JosepMés informacióMés informacióMés informació
Document typeConference report
Defense date2009-10-25
Rights accessOpen Access
Attribution-NonCommercial-NoDerivs 3.0 Spain
Except where otherwise noted, content on this work is licensed under a Creative Commons license : Attribution-NonCommercial-NoDerivs 3.0 Spain
Abstract
One 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.
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. 
URIhttp://hdl.handle.net/2117/7377
ISBN978-3-540-87920-6
Collections
  • Departament de Matemàtiques - Ponències/Comunicacions de congressos [1.057]
  • LaCàN - Mètodes Numèrics en Ciències Aplicades i Enginyeria - Ponències/Comunicacions de congressos [154]
  View Usage Statistics

Show full item record

FilesDescriptionSizeFormatView
A new procedure.pdf996,6KbPDFView/Open

Browse

This CollectionBy Issue DateAuthorsOther contributionsTitlesSubjectsThis repositoryCommunities & CollectionsBy Issue DateAuthorsOther contributionsTitlesSubjects

© UPC Obrir en finestra nova . Servei de Biblioteques, Publicacions i Arxius

info.biblioteques@upc.edu

  • About This Repository
  • Contact Us
  • Send Feedback
  • Privacy Settings
  • Inici de la pàgina