Ruiz Girones, Eloi
Total activity: 15
Department
Department of Applied Mathematics III
E-mail
eloi.ruizupc.edu
Contact details
UPC directory Open in new window

Graphic summary
  • Show / hide key
  • Information


Scientific and technological production
  •  

1 to 15 of 15 results
  • Preserving isotropic element size functions in adaptivity, quadrilateral and hexahedral mesh generation

     Ruiz Girones, Eloi; Roca Navarro, Xevi; Sarrate Ramos, Jose
    Advances in engineering software
    Vol. 65, p. 168-181
    Date of publication: 2013
    Journal article

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    In electric circuit theory, it is of great interest to compute the effective resistance between any pair of vertices of a network, as well as the Kirchhoff Index. During the last decade these parametres have been applied in Organic Chemistry as natural structural indexes different from the usual ones in order to achieve an improvement in the discrimination between different molecules which have similar structural behaviours. Moreover, a wide range of generalized Kirchhoff Indexes for some networks have been introduced. The objective of the present work is to obtain the Kirchhoff Index for a wide range of composite networks known as cluster networks

    In electric circuit theory, it is of great interest to compute the effective resistance between any pair of vertices of a network, as well as the Kirchhoff Index. During the last decade these parametres have been applied in Organic Chemistry as natural structural indexes different from the usual ones in order to achieve an improvement in the discrimination between different molecules which have similar structural behaviours. Moreover, a wide range of generalized Kirchhoff Indexes for some networks have been introduced. The objective of the present work is to obtain the Kirchhoff Index for a wide range of composite networks known as cluster networks.

  • Using a computational domain and a three-stage node location procedure for multi-sweeping algorithms

     Ruiz Girones, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Jose
    Advances in engineering software
    Vol. 42, num. 9, p. 700-713
    DOI: 10.1016/j.advengsoft.2011.05.006
    Date of publication: 2011
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • The receding front method applied to hexahedral mesh generation of exterior domains

     Ruiz Girones, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Jose
    Engineering with computers
    Vol. 28, num. 4, p. 391-408
    DOI: 10.1007/s00366-011-0233-y
    Date of publication: 2011-11-30
    Journal article

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Automatic Hexahedral meshing algorithms: From structured to unstructured meshes

     Ruiz Girones, Eloi
    Department of Applied Mathematics III, Universitat Politècnica de Catalunya
    Theses

     Share Reference managers Reference managers Open in new window

  • Automatic hexaedral meshing algorithms: from structured to unstructured meshes

     Ruiz Girones, Eloi
    Department of Applied Mathematics III, Universitat Politècnica de Catalunya
    Theses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Unstructures hexahedral mesh generation for esterior domains by the receding front method

     Ruiz Girones, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Jose
    Congreso en Métodos Numéricos em Engenharia
    p. 211-
    Presentation's date: 2011-06-15
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Unstructured hexaedral mesh generation for exteroir domains by the receding front method

     Ruiz Girones, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Jose
    Congresso de Métodos Numéricos em Engenharia
    p. 1-17
    Presentation's date: 2011-06-14
    Presentation of work at congresses

    View View Open in new window  Share Reference managers Reference managers Open in new window

  • Access to the full text
    Generation of structured hexahedral meshes in volumes with holes  Open access

     Ruiz Girones, Eloi; Sarrate Ramos, Jose
    Finite elements in analysis and design
    Vol. 46, num. 10, p. 792-804
    DOI: 10.1016/j.finel.2010.04.005
    Date of publication: 2010-10
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    The submapping method is one of the most used techniques to generate structured hexahedral meshes. This method splits the geometry into pieces logically equivalent to an hexahedron. Then, it meshes each patch keeping the mesh compatibility between pieces by solving an integer linear problem. The quality of the final discretization is governed by the objective function that defines the linear problem. Thus, in this work we propose a new objective function that better distributes the number of intervals among the edges of the geometry. In addition, special procedures have to be developed in order to apply the submapping method to volumes with holes. This article also presents two original contributions to efficiently mesh geometries that contain holes. Finally, it presents several numerical examples that show the applicability of the developed algorithms.

  • Access to the full text
    Generation of structured meshes in multiply connected surfaces using submapping  Open access

     Ruiz Girones, Eloi; Sarrate Ramos, Jose
    Advances in engineering software
    Vol. 41, num. 2, p. 379-387
    DOI: 10.1016/j.advengsoft.2009.06.009
    Date of publication: 2010-02
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    The submapping method is one of the most widely used techniques to generate structured quadrilateral meshes. This method splits the geometry into pieces logically equivalent to a quadrilateral. Then, it meshes each piece keeping the mesh compatibility between them by solving an integer linear problem. The main limitation of submapping algorithms is that it can only be applied to geometries in which the angle between two consecutive edges is, approximately, an integer multiple of p=2. In addition, special procedures are required in order to apply it to multiply connected domains. This article presents two original modifications to mitigate these shortcomings. Finally, it presents several numerical examples that show the applicability of the developed algorithms.

    Postprint (author’s final draft)

  • Inside-to-outside hex-meshing approach guided by level sets of distance functions

     Roca Navarro, Francisco Javier; Ruiz Girones, Eloi; Sarrate Ramos, Jose
    Hex Meshing and CFD blocking seminar
    Presentation's date: 2010
    Presentation of work at congresses

     Share Reference managers Reference managers Open in new window

  • Receding front method: a new approach applied to generate hexahedral meshes of outer domains

     Roca Navarro, Francisco Javier; Ruiz Girones, Eloi; Sarrate Ramos, Jose
    International Meshing Roundtable
    p. 1-17
    DOI: 10.1007/978-3-642-15414-0_13
    Presentation of work at congresses

    Read the abstract Read the abstract View View Open in new window  Share Reference managers Reference managers Open in new window

    Two of the most successful methods to generate unstructured hexahedral meshes are the grid-based methods and the advancing front methods. On the one hand, the grid-based methods generate high quality elements in the inner part of the domain using an inside-outside approach. On the other hand, advancing front methods generate high quality hexahedra near the boundary using an outside-inside approach. In this paper we propose the receding front method, an original approach that combines the advantages of both methodologies: we use an inside-outside mesh generation approach by means of a reversed front advance. We apply this approach to mesh outer domains. To reproduce the shape of the boundaries, we first precompute the mesh fronts by combining two solutions of the Eikonal equation on a tetrahedral reference mesh. Then, to generate high quality elements, we expand the quadrilateral surface mesh of the inner body towards the unmeshed external boundary using the pre-computed fronts as a guide. Further research is under way in order to apply the proposed method to more complicated geometries.

  • Access to the full text
    Automatic generation of hexahedral meshes for volumes with non-planar surfaces using the multi-sweeping method  Open access

     Ruiz Girones, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Jose
    International Conference on Engineering Computational Technology
    p. 1-19
    DOI: 10.4203/ccp.94.58
    Presentation's date: 2010
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    One of the most used algorithms to generate hexahedral meshes for extrusion volumes is the multi-sweeping method. The algorithm decomposes the geometry into many-to-one sub-volumes and then meshes each sub-volume separately. However, the quality of the final mesh depends on the decomposition process. First, the location of inner nodes created during the decomposition process may induce bad quality elements. To avoid this drawback, we propose a three-stage decomposition process to locate those nodes. Second, the imprinting process is not robust when dealing with non-planar surfaces. For this reason, we introduce the new concept of the computational domain. The computational domain is a planar representation of the levels of the geometry. In this way, we improve the operations needed to perform imprints.

  • MÈTODES NUMÈRICS EN CIÈNCIES APLICADES I ENGINYERIA

     Roca Navarro, Francisco Javier; Giorgiani, Giorgio; Zlotnik, Sergio; Fernandez Mendez, Sonia; Rodriguez Ferran, Antonio; Muñoz Romero, Jose Javier; Arias Vicente, Irene; de Villardi de Montlaur, Adeline; Sarrate Ramos, Jose; Diez Mejia, Pedro; Arroyo Balaguer, Marino; Sevilla Cardenas, Ruben; Parés Mariné, Núria; Casoni Rero, Eva; Ruiz Girones, Eloi; Modesto Galende, David; Millan, Raul Daniel; Abdollahi Hosnijeh, Amir; Steffens, Lindaura Maria; Discacciati, Marco; Shen, Yongxing; Rahimi Lenji, Mohammad; Tamayo Mas, Elena; Diaz Cereceda, Cristina; Prat Robles, David; Verdugo Rojano, Francesc; Zhang, Kuan; Estela Carbonell, M. Rosa; Peco Regales, Christian; Huerta Cerezuela, Antonio
    Competitive project

     Share

  • Access to the full text
    A new procedure to compute imprints in multi-sweeping algorithms  Open access

     Ruiz Girones, Eloi; Roca Navarro, Francisco Javier; Sarrate Ramos, Jose
    International Meshing Roundtable
    p. 281-299
    Presentation's date: 2009-10-26
    Presentation of work at congresses

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    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.

  • Access to the full text
    Discretización de superficies múltiplemente conexas mediante submapping  Open access

     Ruiz Girones, Eloi; Sarrate Ramos, Jose
    Revista internacional de métodos numéricos para cálculo y diseño en ingeniería
    Vol. 24, num. 2, p. 163-181
    Date of publication: 2008-09
    Journal article

    Read the abstract Read the abstract Access to the full text Access to the full text Open in new window  Share Reference managers Reference managers Open in new window

    Una de las técnicas más utilizadas para generar mallas estructuradas de cuadriláteros es el método de submapping. Este método descompone la geometría en piezas lógicamente equivalentes a un cuadrilátero y después malla cada una de ellas por separado manteniendo la compatibilidad de la malla mediante la resolución de un problema lineal entero. El algoritmo de submapping tiene dos limitaciones principales. La primera de ellas es que sólo se puede aplicar en geometrías tales que el ángulo entre dos aristas consecutivas es, aproximadamente, un múltiplo entero de π/2. La segunda limitación es que la geometría tiene que ser simplemente conexa. Con el objetivo de mitigar estas restricciones, en este artículo se presentan dos modificaciones originales que permiten reducir el efecto de dichas limitaciones. Finalmente, se presentan diversos ejemplos numéricos que ponen de manifiesto la robustez y la aplicabilidad de los algoritmos desarrollados.