Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 18
Encontrada(s) 1 página(s)

UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Local bisection for conformal refinement of unstructured 4D simplicial meshes

  • Belda-Ferrín, Guillem
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes with bounded minimum shape quality. Specifically, we propose a recursive refine-to-conformity procedure in two stages, based on marking bisection edges on different priority levels and defining specific refinement templates. Two successive applications of the first stage ensure that any 4D unstructured mesh can be conformingly refined. In the second stage, the successive refinements lead to a cycle in the number of generated similarity classes and thus, we can ensure a bound over the minimum shape quality. In the examples, we check that after successive refinement the mesh quality does not degenerate. Moreover, we refine a 4D unstructured mesh and a space-time mesh (3D + 1D) representation of a moving object.
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Defining a stretching and alignment aware quality measure for linear and curved 2D meshes

  • Aparicio Estrems, Guillermo|||0000-0002-1956-0409
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
We define a regularized shape distortion (quality) measure for curved high-order 2D elements on a Riemannian plane. To this end, we measure the deviation of a given 2D element, straight-sided or curved, from the stretching and alignment determined by a target metric. The defined distortion (quality) is suitable to check the validity and the quality of straight-sided and curved elements on Riemannian planes determined by constant and point-wise varying metrics. The examples illustrate that the distortion can be minimized to curve (deform) the elements of a given high-order (linear) mesh and try to match with curved (linear) elements the point-wise alignment and stretching of an analytic target metric tensor.
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Subdivided linear and curved meshes preserving features of a linear mesh model

  • Jiménez Ramos, Albert|||0000-0002-6537-149X
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
To provide straight-edged and curved piece-wise polynomial meshes that target a unique smooth geometry while preserving the sharp features and smooth regions of the model, we propose a new fast curving method based on hierarchical subdivision and blending. There is no need for underlying target geometry, it is only needed a straight-edged mesh with boundary entities marked to characterize the geometry features, and a list of features to recast. The method features a unique sharp-to-smooth modeling capability not fully available in standard CAD packages. The goal is to obtain a volume mesh that under successive refinement leads to smooth regions bounded by the corresponding sharp features. The examples show that it is possible to refine and obtain smooth curves and surfaces while preserving sharp features determined by vertices and polylines. We conclude that the method is well-suited to curve large quadratic and quartic meshes in low-memory configurations., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of the third author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Defining a stretching and alignment aware quality measure for linear and curved 2D meshes

  • Aparicio Estrems, Guillermo|||0000-0002-1956-0409
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
We define a regularized shape distortion (quality) measure for curved high-order 2D elements on a Riemannian plane. To this end, we measure the deviation of a given 2D element, straight-sided or curved, from the stretching and alignment determined by a target metric. The defined distortion (quality) is suitable to check the validity and the quality of straight-sided and curved elements on Riemannian planes determined by constant and point-wise varying metrics. The examples illustrate that the distortion can be minimized to curve (deform) the elements of a given high-order (linear) mesh and try to match with curved (linear) elements the point-wise alignment and stretching of an analytic target metric tensor., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya un-der grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

An augmented Lagrangian formulation to impose boundary conditions for distortion based mesh moving and curving

  • Ruiz Gironès, Eloi
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Sarrate Ramos, Josep|||0000-0003-0182-934X
  • Roca Navarro, Francisco Javier
We formulate a mesh morphing technique as mesh distortion minimization problem constrained to weakly satisfy the imposed displacement of the boundary nodes. The method is devised to penalize the appearance of inverted elements during the optimization process. Accordingly, we have not equipped the method with untangling capabilities. To solve the constrained minimization problem, we apply the augmented Lagrangian technique to incorporate the boundary condition in the objective function using the Lagrangian multipliers and a penalty parameter. We have applied the proposed formulation to mesh moving and mesh curving problems. The results show that the method has the ability to deal with large displacements for 2D and 3D meshes with non-uniform sizing, and mesh curving of highly stretched 2D high-order meshes., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Local bisection for conformal refinement of unstructured 4D simplicial meshes

  • Belda Ferrín, Guillem|||0000-0002-6268-7691
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes with bounded minimum shape quality. Specifically, we propose a recursive refine to conformity procedure in two stages, based on marking bisection edges on different priority levels and defining specific refinement templates. Two successive applications of the first stage ensure that any 4D unstructured mesh can be conformingly refined. In the second stage, the successive refinements lead to a cycle in the number of generated similarity classes and thus, we can ensure a bound over the minimum shape quality. In the examples, we check that after successive refinement the mesh quality does not degenerate. Moreover, we refine a 4D unstructured mesh and a space-time mesh (3D + 1D) representation of a moving object., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Bisecting with optimal similarity bound on 3D unstructured conformal meshes

  • Belda Ferrín, Guillem|||0000-0002-6268-7691
  • Ruiz Gironès, Eloi
  • Roca Navarro, Francisco Javier
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal mesh. For these meshes, the approach conformingly marks all the tetrahedra with coplanar edge marks. To this end, the method needs three key ingredients. First, we propose a specific edge ordering. Second, marking with this ordering, we guarantee that the mesh becomes conformingly marked. Third, we also ensure that all the marks are coplanar in each tetrahedron. To demonstrate the marking method, we implement an existent marked bisection approach. Using this implementation, we mark and then locally refine 3D unstructured conformal meshes. We conclude that the resulting marked bisection features an optimal bound of similarity classes per tetrahedron., This project has received funding from the European Research Council (ERC) under the European Union’sHorizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Refining simplex points for scalable estimation of the Lebesgue constant

  • Jiménez Ramos, Albert|||0000-0002-6537-149X
  • Gargallo Peiró, Abel|||0000-0003-3742-2197
  • Roca Navarro, Francisco Javier
To estimate the Lebesgue constant, we propose a point refinement method on the d-dimensional simplex. The proposed method features a smooth gradation of the point resolution, neighbor queries based on neighbor-aware coordinates, and a point refinement that algebraically scales as (d + 1) d. Remarkably, by using neighbor-aware coordinates, the point refinement method is ready to automatically stop using a Lipschitz criterion. For different polynomial degrees and point distributions, we show that our automatic method efficiently reproduces the literature estimations for the triangle and the tetrahedron. Moreover, we efficiently estimate the Lebesgue constant in higher dimensions. Accordingly, up to six dimensions, we conclude that the point refinement method is well-suited to efficiently estimate the Lebesgue constant on simplices. In perspective, for a given polynomial degree, the proposed point refinement method might be relevant to optimize a set of simplex points that guarantees a small interpolation error., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of the second author has been partially supported by Grant IJC2020-045140-I from MCIN/AEI/10.13039/501100011 033 and “European Union NextGenerationEU/PRTR”. The work of the third author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed
UPCommons. Portal del coneixement obert de la UPC
Publicación Contribución de congreso (ConferenceOutput)

Estimating the Number of Similarity Classes for Marked Bisection in General Dimensions

  • Belda Ferrín, Guillem|||0000-0002-6268-7691
  • Ruiz-Gironés, Eloi
  • Roca, Xevi
To measure the stability of a marked bisection method, we estimate in general dimensions an upper bound of the number of generated similarity classes. Moreover, to understand the cyclic similarity structure, we estimate the number of uniform refinements required to generate all the similarity classes. We first prove that switching to the newest vertex bisection after n uniform refinements is equivalent to switching after uniform refinements. Then, we obtain the similarity bound, a bound that we use to derive the number of uniform refinements required to generate all the similarity classes. Although the similarity bound is not tight, the results show that it estimates the magnitude of the expected number of classes. We also show the ratio of the number of similarity classes for marked bisection and newest vertex bisection. Because this ratio grows exponentially with the dimension, we conclude that marked bisection is suitable for low-dimensional applications., his project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has alsoreceived funding from the Generalitat de Catalunyaunder grant number 2017 SGR 1731. The work ofXevi Roca has been partially supported by the Spanish Ministerio de Econom´ıa y Competitividad under the personal grant agreement RYC-2015-01633, Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Bisecting with optimal similarity bound on 3D unstructured conformal meshes

  • Belda Ferrín, Guillem
  • Ruiz Gironès, Eloi
  • Roca Navarro, Francisco Javier
We propose a new method to mark for bisection the edges of an arbitrary 3D unstructured conformal mesh. For these meshes, the approach conformingly marks all the tetrahedra with coplanar edge marks. To this end, the method needs three key ingredients. First, we propose a specific edge ordering. Second, marking with this ordering, we guarantee that the mesh becomes conformingly marked. Third, we also ensure that all the marks are coplanar in each tetrahedron. To demonstrate the marking method, we implement an existent marked bisection approach. Using this implementation, we mark and then locally refine 3D unstructured conformal meshes. We conclude that the resulting marked bisection features an optimal bound of similarity classes per tetrahedron., This project has received funding from the European Research Council (ERC) under the European Union’sHorizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Local bisection for conformal refinement of unstructured 4D simplicial meshes

  • Belda Ferrín, Guillem
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes with bounded minimum shape quality. Specifically, we propose a recursive refine to conformity procedure in two stages, based on marking bisection edges on different priority levels and defining specific refinement templates. Two successive applications of the first stage ensure that any 4D unstructured mesh can be conformingly refined. In the second stage, the successive refinements lead to a cycle in the number of generated similarity classes and thus, we can ensure a bound over the minimum shape quality. In the examples, we check that after successive refinement the mesh quality does not degenerate. Moreover, we refine a 4D unstructured mesh and a space-time mesh (3D + 1D) representation of a moving object., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

An augmented Lagrangian formulation to impose boundary conditions for distortion based mesh moving and curving

  • Ruiz Gironès, Eloi
  • Gargallo Peiró, Abel
  • Sarrate Ramos, Josep
  • Roca Navarro, Francisco Javier
We formulate a mesh morphing technique as mesh distortion minimization problem constrained to weakly satisfy the imposed displacement of the boundary nodes. The method is devised to penalize the appearance of inverted elements during the optimization process. Accordingly, we have not equipped the method with untangling capabilities. To solve the constrained minimization problem, we apply the augmented Lagrangian technique to incorporate the boundary condition in the objective function using the Lagrangian multipliers and a penalty parameter. We have applied the proposed formulation to mesh moving and mesh curving problems. The results show that the method has the ability to deal with large displacements for 2D and 3D meshes with non-uniform sizing, and mesh curving of highly stretched 2D high-order meshes., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Defining a stretching and alignment aware quality measure for linear and curved 2D meshes

  • Aparicio Estrems, Guillermo
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
We define a regularized shape distortion (quality) measure for curved high-order 2D elements on a Riemannian plane. To this end, we measure the deviation of a given 2D element, straight-sided or curved, from the stretching and alignment determined by a target metric. The defined distortion (quality) is suitable to check the validity and the quality of straight-sided and curved elements on Riemannian planes determined by constant and point-wise varying metrics. The examples illustrate that the distortion can be minimized to curve (deform) the elements of a given high-order (linear) mesh and try to match with curved (linear) elements the point-wise alignment and stretching of an analytic target metric tensor., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya un-der grant number 2017 SGR 1731. The work of X. Roca has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Estimating the Number of Similarity Classes for Marked Bisection in General Dimensions

  • Belda Ferrín, Guillem
  • Ruiz-Gironés, Eloi
  • Roca, Xevi
To measure the stability of a marked bisection method, we estimate in general dimensions an upper bound of the number of generated similarity classes. Moreover, to understand the cyclic similarity structure, we estimate the number of uniform refinements required to generate all the similarity classes. We first prove that switching to the newest vertex bisection after n uniform refinements is equivalent to switching after uniform refinements. Then, we obtain the similarity bound, a bound that we use to derive the number of uniform refinements required to generate all the similarity classes. Although the similarity bound is not tight, the results show that it estimates the magnitude of the expected number of classes. We also show the ratio of the number of similarity classes for marked bisection and newest vertex bisection. Because this ratio grows exponentially with the dimension, we conclude that marked bisection is suitable for low-dimensional applications., his project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has alsoreceived funding from the Generalitat de Catalunyaunder grant number 2017 SGR 1731. The work ofXevi Roca has been partially supported by the Spanish Ministerio de Econom´ıa y Competitividad under the personal grant agreement RYC-2015-01633, Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Local bisection for conformal refinement of unstructured 4D simplicial meshes

  • Belda-Ferrín, Guillem
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
We present a conformal bisection procedure for local refinement of 4D unstructured simplicial meshes with bounded minimum shape quality. Specifically, we propose a recursive refine-to-conformity procedure in two stages, based on marking bisection edges on different priority levels and defining specific refinement templates. Two successive applications of the first stage ensure that any 4D unstructured mesh can be conformingly refined. In the second stage, the successive refinements lead to a cycle in the number of generated similarity classes and thus, we can ensure a bound over the minimum shape quality. In the examples, we check that after successive refinement the mesh quality does not degenerate. Moreover, we refine a 4D unstructured mesh and a space-time mesh (3D + 1D) representation of a moving object.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Defining a stretching and alignment aware quality measure for linear and curved 2D meshes

  • Aparicio Estrems, Guillermo
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
We define a regularized shape distortion (quality) measure for curved high-order 2D elements on a Riemannian plane. To this end, we measure the deviation of a given 2D element, straight-sided or curved, from the stretching and alignment determined by a target metric. The defined distortion (quality) is suitable to check the validity and the quality of straight-sided and curved elements on Riemannian planes determined by constant and point-wise varying metrics. The examples illustrate that the distortion can be minimized to curve (deform) the elements of a given high-order (linear) mesh and try to match with curved (linear) elements the point-wise alignment and stretching of an analytic target metric tensor.
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Subdivided linear and curved meshes preserving features of a linear mesh model

  • Jiménez Ramos, Albert
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
To provide straight-edged and curved piece-wise polynomial meshes that target a unique smooth geometry while preserving the sharp features and smooth regions of the model, we propose a new fast curving method based on hierarchical subdivision and blending. There is no need for underlying target geometry, it is only needed a straight-edged mesh with boundary entities marked to characterize the geometry features, and a list of features to recast. The method features a unique sharp-to-smooth modeling capability not fully available in standard CAD packages. The goal is to obtain a volume mesh that under successive refinement leads to smooth regions bounded by the corresponding sharp features. The examples show that it is possible to refine and obtain smooth curves and surfaces while preserving sharp features determined by vertices and polylines. We conclude that the method is well-suited to curve large quadratic and quartic meshes in low-memory configurations., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of the third author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Refining simplex points for scalable estimation of the Lebesgue constant

  • Jiménez Ramos, Albert
  • Gargallo Peiró, Abel
  • Roca Navarro, Francisco Javier
To estimate the Lebesgue constant, we propose a point refinement method on the d-dimensional simplex. The proposed method features a smooth gradation of the point resolution, neighbor queries based on neighbor-aware coordinates, and a point refinement that algebraically scales as (d + 1) d. Remarkably, by using neighbor-aware coordinates, the point refinement method is ready to automatically stop using a Lipschitz criterion. For different polynomial degrees and point distributions, we show that our automatic method efficiently reproduces the literature estimations for the triangle and the tetrahedron. Moreover, we efficiently estimate the Lebesgue constant in higher dimensions. Accordingly, up to six dimensions, we conclude that the point refinement method is well-suited to efficiently estimate the Lebesgue constant on simplices. In perspective, for a given polynomial degree, the proposed point refinement method might be relevant to optimize a set of simplex points that guarantees a small interpolation error., This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme under grant agreement No 715546. This work has also received funding from the Generalitat de Catalunya under grant number 2017 SGR 1731. The work of the second author has been partially supported by Grant IJC2020-045140-I from MCIN/AEI/10.13039/501100011 033 and “European Union NextGenerationEU/PRTR”. The work of the third author has been partially supported by the Spanish Ministerio de Economía y Competitividad under the personal grant agreement RYC-2015-01633., Peer Reviewed, Postprint (author's final draft)