Examinando por Materia "Parameterization"

Mostrando 1 - 7 de 7
  • No hay miniatura disponible
    Ítem
    Hessian eigenfunctions for triangular mesh parameterization
    (SciTePress, 2016-02-27) Mejia, D.; Ruiz OE; Cadavid, C.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
    Hessian Locally Linear Embedding (HLLE) is an algorithm that computes the nullspace of a Hessian functional H for Dimensionality Reduction (DR) of a sampled manifold M. This article presents a variation of classic HLLE for parameterization of 3D triangular meshes. Contrary to classic HLLE which estimates local Hessian nullspaces, the proposed approach follows intuitive ideas from Differential Geometry where the local Hessian is estimated by quadratic interpolation and a partition of unity is used to join all neighborhoods. In addition, local average triangle normals are used to estimate the tangent plane TxM at x ? M instead of PCA, resulting in local parameterizations which reflect better the geometry of the surface and perform better when the mesh presents sharp features. A high frequency dataset (Brain) is used to test our algorithm resulting in a higher rate of success (96.63%) compared to classic HLLE (76.4%). © Copyright 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.
  • No hay miniatura disponible
    Ítem
    Hessian eigenfunctions for triangular mesh parameterization
    (SciTePress, 2016-02-27) Mejia, D.; Ruiz OE; Cadavid, C.; Mejia, D.; Ruiz OE; Cadavid, C.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
    Hessian Locally Linear Embedding (HLLE) is an algorithm that computes the nullspace of a Hessian functional H for Dimensionality Reduction (DR) of a sampled manifold M. This article presents a variation of classic HLLE for parameterization of 3D triangular meshes. Contrary to classic HLLE which estimates local Hessian nullspaces, the proposed approach follows intuitive ideas from Differential Geometry where the local Hessian is estimated by quadratic interpolation and a partition of unity is used to join all neighborhoods. In addition, local average triangle normals are used to estimate the tangent plane TxM at x ? M instead of PCA, resulting in local parameterizations which reflect better the geometry of the surface and perform better when the mesh presents sharp features. A high frequency dataset (Brain) is used to test our algorithm resulting in a higher rate of success (96.63%) compared to classic HLLE (76.4%). © Copyright 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.
  • No hay miniatura disponible
    Ítem
    Hybrid geometry / topology based mesh segmentation for reverse engineering
    (PERGAMON-ELSEVIER SCIENCE LTD, 2018-06-01) Mejia D.; Ruiz-Salguero O.; Sánchez J.R.; Posada J.; Moreno A.; Cadavid C.A.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
    Mesh segmentation and parameterization are crucial for Reverse Engineering (RE). Bijective parameterizations of the sub-meshes are a sine-qua-non test for segmentation. Current segmentation methods use either (1) topologic or (2) geometric criteria to partition the mesh. Reported topology-based segmentations produce large sub-meshes which reject parameterizations. Geometry-based segmentations are very sensitive to local variations in dihedral angle or curvatures, thus producing an exaggerated large number of small sub-meshes. Although small sub-meshes accept nearly isometric parameterizations, this significant granulation defeats the intent of synthesizing a usable Boundary Representation (compulsory for RE). In response to these limitations, this article presents an implementation of a hybrid geometry / topology segmentation algorithm for mechanical workpieces. This method locates heat transfer constraints (topological criterion) in low frequency neighborhoods of the mesh (geometric criterion) and solves for the resulting temperature distribution on the mesh. The mesh partition dictated by the temperature scalar map results in large, albeit parameterizable, sub-meshes. Our algorithm is tested with both benchmark repository and physical piece scans data. The experiments are successful, except for the well - known cases of topological cylinders, which require a user - introduced boundary along the cylinder generatrices. © 2018 Elsevier Ltd
  • No hay miniatura disponible
    Ítem
    Hybrid geometry / topology based mesh segmentation for reverse engineering
    (PERGAMON-ELSEVIER SCIENCE LTD, 2018-06-01) Mejia D.; Ruiz-Salguero O.; Sánchez J.R.; Posada J.; Moreno A.; Cadavid C.A.; Mejia D.; Ruiz-Salguero O.; Sánchez J.R.; Posada J.; Moreno A.; Cadavid C.A.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
    Mesh segmentation and parameterization are crucial for Reverse Engineering (RE). Bijective parameterizations of the sub-meshes are a sine-qua-non test for segmentation. Current segmentation methods use either (1) topologic or (2) geometric criteria to partition the mesh. Reported topology-based segmentations produce large sub-meshes which reject parameterizations. Geometry-based segmentations are very sensitive to local variations in dihedral angle or curvatures, thus producing an exaggerated large number of small sub-meshes. Although small sub-meshes accept nearly isometric parameterizations, this significant granulation defeats the intent of synthesizing a usable Boundary Representation (compulsory for RE). In response to these limitations, this article presents an implementation of a hybrid geometry / topology segmentation algorithm for mechanical workpieces. This method locates heat transfer constraints (topological criterion) in low frequency neighborhoods of the mesh (geometric criterion) and solves for the resulting temperature distribution on the mesh. The mesh partition dictated by the temperature scalar map results in large, albeit parameterizable, sub-meshes. Our algorithm is tested with both benchmark repository and physical piece scans data. The experiments are successful, except for the well - known cases of topological cylinders, which require a user - introduced boundary along the cylinder generatrices. © 2018 Elsevier Ltd
  • No hay miniatura disponible
    Ítem
    Weighted area/angle distortion minimization for Mesh Parameterization
    (EMERALD GROUP PUBLISHING LIMITED, 2017-01-01) Mejia D.; Acosta D.A.; Ruiz-Salguero O.; Universidad EAFIT. Departamento de Ingeniería de Procesos; Desarrollo y Diseño de Procesos
    Purpose: Mesh Parameterization is central to reverse engineering, tool path planning, etc. This work synthesizes parameterizations with un-constrained borders, overall minimum angle plus area distortion. This study aims to present an assessment of the sensitivity of the minimized distortion with respect to weighed area and angle distortions. Design/methodology/approach: A Mesh Parameterization which does not constrain borders is implemented by performing: isometry maps for each triangle to the plane Z = 0; an affine transform within the plane Z = 0 to glue the triangles back together; and a Levenberg-Marquardt minimization algorithm of a nonlinear F penalty function that modifies the parameters of the first two transformations to discourage triangle flips, angle or area distortions. F is a convex weighed combination of area distortion (weight: a with 0 = a = 1) and angle distortion (weight: 1 - a). Findings: The present study parameterization algorithm has linear complexity [O(n), n = number of mesh vertices]. The sensitivity analysis permits a fine-tuning of the weight parameter which achieves overall bijective parameterizations in the studied cases. No theoretical guarantee is given in this manuscript for the bijectivity. This algorithm has equal or superior performance compared with the ABF, LSCM and ARAP algorithms for the Ball, Cow and Gargoyle data sets. Additional correct results of this algorithm alone are presented for the Foot, Fandisk and Sliced-Glove data sets. Originality/value: The devised free boundary nonlinear Mesh Parameterization method does not require a valid initial parameterization and produces locally bijective parameterizations in all of our tests. A formal sensitivity analysis shows that the resulting parameterization is more stable, i.e. the UV mapping changes very little when the algorithm tries to preserve angles than when it tries to preserve areas. The algorithm presented in this study belongs to the class that parameterizes meshes with holes. This study presents the results of a complexity analysis comparing the present study algorithm with 12 competing ones. © Emerald Publishing Limited.
  • No hay miniatura disponible
    Ítem
    Weighted area/angle distortion minimization for Mesh Parameterization
    (EMERALD GROUP PUBLISHING LIMITED, 2017-01-01) Mejia D.; Acosta D.A.; Ruiz-Salguero O.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
    Purpose: Mesh Parameterization is central to reverse engineering, tool path planning, etc. This work synthesizes parameterizations with un-constrained borders, overall minimum angle plus area distortion. This study aims to present an assessment of the sensitivity of the minimized distortion with respect to weighed area and angle distortions. Design/methodology/approach: A Mesh Parameterization which does not constrain borders is implemented by performing: isometry maps for each triangle to the plane Z = 0; an affine transform within the plane Z = 0 to glue the triangles back together; and a Levenberg-Marquardt minimization algorithm of a nonlinear F penalty function that modifies the parameters of the first two transformations to discourage triangle flips, angle or area distortions. F is a convex weighed combination of area distortion (weight: a with 0 = a = 1) and angle distortion (weight: 1 - a). Findings: The present study parameterization algorithm has linear complexity [O(n), n = number of mesh vertices]. The sensitivity analysis permits a fine-tuning of the weight parameter which achieves overall bijective parameterizations in the studied cases. No theoretical guarantee is given in this manuscript for the bijectivity. This algorithm has equal or superior performance compared with the ABF, LSCM and ARAP algorithms for the Ball, Cow and Gargoyle data sets. Additional correct results of this algorithm alone are presented for the Foot, Fandisk and Sliced-Glove data sets. Originality/value: The devised free boundary nonlinear Mesh Parameterization method does not require a valid initial parameterization and produces locally bijective parameterizations in all of our tests. A formal sensitivity analysis shows that the resulting parameterization is more stable, i.e. the UV mapping changes very little when the algorithm tries to preserve angles than when it tries to preserve areas. The algorithm presented in this study belongs to the class that parameterizes meshes with holes. This study presents the results of a complexity analysis comparing the present study algorithm with 12 competing ones. © Emerald Publishing Limited.
  • No hay miniatura disponible
    Ítem
    Weighted area/angle distortion minimization for Mesh Parameterization
    (EMERALD GROUP PUBLISHING LIMITED, 2017-01-01) Mejia D.; Acosta D.A.; Ruiz-Salguero O.; Mejia D.; Acosta D.A.; Ruiz-Salguero O.; Universidad EAFIT. Departamento de Ingeniería de Procesos; Procesos Ambientales (GIPAB)
    Purpose: Mesh Parameterization is central to reverse engineering, tool path planning, etc. This work synthesizes parameterizations with un-constrained borders, overall minimum angle plus area distortion. This study aims to present an assessment of the sensitivity of the minimized distortion with respect to weighed area and angle distortions. Design/methodology/approach: A Mesh Parameterization which does not constrain borders is implemented by performing: isometry maps for each triangle to the plane Z = 0; an affine transform within the plane Z = 0 to glue the triangles back together; and a Levenberg-Marquardt minimization algorithm of a nonlinear F penalty function that modifies the parameters of the first two transformations to discourage triangle flips, angle or area distortions. F is a convex weighed combination of area distortion (weight: a with 0 = a = 1) and angle distortion (weight: 1 - a). Findings: The present study parameterization algorithm has linear complexity [O(n), n = number of mesh vertices]. The sensitivity analysis permits a fine-tuning of the weight parameter which achieves overall bijective parameterizations in the studied cases. No theoretical guarantee is given in this manuscript for the bijectivity. This algorithm has equal or superior performance compared with the ABF, LSCM and ARAP algorithms for the Ball, Cow and Gargoyle data sets. Additional correct results of this algorithm alone are presented for the Foot, Fandisk and Sliced-Glove data sets. Originality/value: The devised free boundary nonlinear Mesh Parameterization method does not require a valid initial parameterization and produces locally bijective parameterizations in all of our tests. A formal sensitivity analysis shows that the resulting parameterization is more stable, i.e. the UV mapping changes very little when the algorithm tries to preserve angles than when it tries to preserve areas. The algorithm presented in this study belongs to the class that parameterizes meshes with holes. This study presents the results of a complexity analysis comparing the present study algorithm with 12 competing ones. © Emerald Publishing Limited.