Repositorio Institucional Universidad EAFIT ::Examinando por Materia "Reverse engineering"

Examinando por Materia "Reverse engineering"

Mostrando 1 - 17 de 17

Aerodynamic effects of manufacturing tolerances on a solar car
(Springer Science and Business Media Deutschland GmbH, 2017-01-01) Betancur, E.; Fragassa, C.; Coy, J.; Hincapie, S.; Osorio-Gómez, G.
In the case of solar vehicles, since the primary necessity is to optimise the energy efficiency during motion, many efforts are addressed by designers in searching the perfect aerodynamics. It means, in particular, the minimization of the drag force at cruising speeds and an elaborated vehicle’s Computer-Aided Design (CAD) are the principal result of this activity. Despite, these efforts can be nullified by geometrical tolerances emerging from manufacturing. In this paper, the effects of tolerances introduced by composite manufacturing processes are investigated combining 3D scanning technology and Computational Fluid Dynamics (CFD). After the solar car manufacturing, a reverse engineering process is executed with the aim to scan the vehicle’s body and compare it to the initial theoretical design. Geometric deviations are found and their aerodynamic consequences are evaluated in terms of aerodynamic losses. © Springer International Publishing AG 2017.
Geodesic-based manifold learning for parameterization of triangular meshes
(Springer-Verlag France, 2016-11-01) Acosta, D.A.; Ruiz, O.E.; Arroyave, S.; Ebratt, R.; Cadavid, C.; Londono, J.J.; Acosta, Diego A.; Acosta, D.A.; Ruiz, O.E.; Arroyave, S.; Ebratt, R.; Cadavid, C.; Londono, J.J.; Acosta, Diego A.; Universidad EAFIT. Departamento de Ingeniería de Procesos; Procesos Ambientales (GIPAB)
Reverse Engineering (RE) requires representing with free forms (NURBS, Spline, B,zier) a real surface which has been point-sampled. To serve this purpose, we have implemented an algorithm that minimizes the accumulated distance between the free form and the (noisy) point sample. We use a dual-distance calculation point to / from surfaces, which discourages the forming of outliers and artifacts. This algorithm seeks a minimum in a function that represents the fitting error, by using as tuning variable the control polyhedron for the free form. The topology (rows, columns) and geometry of the control polyhedron are determined by alternative geodesic-based dimensionality reduction methods: (a) graph-approximated geodesics (Isomap), or (b) PL orthogonal geodesic grids. We assume the existence of a triangular mesh of the point sample (a reasonable expectation in current RE). A bijective composition mapping allows to estimate a size of the control polyhedrons favorable to uniform-speed parameterizations. Our results show that orthogonal geodesic grids is a direct and intuitive parameterization method, which requires more exploration for irregular triangle meshes. Isomap gives a usable initial parameterization whenever the graph approximation of geodesics on be faithful. These initial guesses, in turn, produce efficient free form optimization processes with minimal errors. Future work is required in further exploiting the usual triangular mesh underlying the point sample for (a) enhancing the segmentation of the point set into faces, and (b) using a more accurate approximation of the geodesic distances within , which would benefit its dimensionality reduction.
Geodesic-based manifold learning for parameterization of triangular meshes
(Springer-Verlag France, 2016-11-01) Acosta, D.A.; Ruiz, O.E.; Arroyave, S.; Ebratt, R.; Cadavid, C.; Londono, J.J.; Acosta, Diego A.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
Reverse Engineering (RE) requires representing with free forms (NURBS, Spline, B,zier) a real surface which has been point-sampled. To serve this purpose, we have implemented an algorithm that minimizes the accumulated distance between the free form and the (noisy) point sample. We use a dual-distance calculation point to / from surfaces, which discourages the forming of outliers and artifacts. This algorithm seeks a minimum in a function that represents the fitting error, by using as tuning variable the control polyhedron for the free form. The topology (rows, columns) and geometry of the control polyhedron are determined by alternative geodesic-based dimensionality reduction methods: (a) graph-approximated geodesics (Isomap), or (b) PL orthogonal geodesic grids. We assume the existence of a triangular mesh of the point sample (a reasonable expectation in current RE). A bijective composition mapping allows to estimate a size of the control polyhedrons favorable to uniform-speed parameterizations. Our results show that orthogonal geodesic grids is a direct and intuitive parameterization method, which requires more exploration for irregular triangle meshes. Isomap gives a usable initial parameterization whenever the graph approximation of geodesics on be faithful. These initial guesses, in turn, produce efficient free form optimization processes with minimal errors. Future work is required in further exploiting the usual triangular mesh underlying the point sample for (a) enhancing the segmentation of the point set into faces, and (b) using a more accurate approximation of the geodesic distances within , which would benefit its dimensionality reduction.
Geodesic-based manifold learning for parameterization of triangular meshes
(Springer-Verlag France, 2016-11-01) Acosta, D.A.; Ruiz, O.E.; Arroyave, S.; Ebratt, R.; Cadavid, C.; Londono, J.J.; Acosta, Diego A.; Universidad EAFIT. Departamento de Ingeniería de Procesos; Desarrollo y Diseño de Procesos
Reverse Engineering (RE) requires representing with free forms (NURBS, Spline, B,zier) a real surface which has been point-sampled. To serve this purpose, we have implemented an algorithm that minimizes the accumulated distance between the free form and the (noisy) point sample. We use a dual-distance calculation point to / from surfaces, which discourages the forming of outliers and artifacts. This algorithm seeks a minimum in a function that represents the fitting error, by using as tuning variable the control polyhedron for the free form. The topology (rows, columns) and geometry of the control polyhedron are determined by alternative geodesic-based dimensionality reduction methods: (a) graph-approximated geodesics (Isomap), or (b) PL orthogonal geodesic grids. We assume the existence of a triangular mesh of the point sample (a reasonable expectation in current RE). A bijective composition mapping allows to estimate a size of the control polyhedrons favorable to uniform-speed parameterizations. Our results show that orthogonal geodesic grids is a direct and intuitive parameterization method, which requires more exploration for irregular triangle meshes. Isomap gives a usable initial parameterization whenever the graph approximation of geodesics on be faithful. These initial guesses, in turn, produce efficient free form optimization processes with minimal errors. Future work is required in further exploiting the usual triangular mesh underlying the point sample for (a) enhancing the segmentation of the point set into faces, and (b) using a more accurate approximation of the geodesic distances within , which would benefit its dimensionality reduction.
Geodesic-based manifold learning for parameterization of triangular meshes
(Springer-Verlag France, 2016-11-01) Acosta, D.A.; Ruiz, O.E.; Arroyave, S.; Ebratt, R.; Cadavid, C.; Londono, J.J.; Acosta, Diego A.; Acosta, D.A.; Ruiz, O.E.; Arroyave, S.; Ebratt, R.; Cadavid, C.; Londono, J.J.; Acosta, Diego A.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y Aplicaciones
Reverse Engineering (RE) requires representing with free forms (NURBS, Spline, B,zier) a real surface which has been point-sampled. To serve this purpose, we have implemented an algorithm that minimizes the accumulated distance between the free form and the (noisy) point sample. We use a dual-distance calculation point to / from surfaces, which discourages the forming of outliers and artifacts. This algorithm seeks a minimum in a function that represents the fitting error, by using as tuning variable the control polyhedron for the free form. The topology (rows, columns) and geometry of the control polyhedron are determined by alternative geodesic-based dimensionality reduction methods: (a) graph-approximated geodesics (Isomap), or (b) PL orthogonal geodesic grids. We assume the existence of a triangular mesh of the point sample (a reasonable expectation in current RE). A bijective composition mapping allows to estimate a size of the control polyhedrons favorable to uniform-speed parameterizations. Our results show that orthogonal geodesic grids is a direct and intuitive parameterization method, which requires more exploration for irregular triangle meshes. Isomap gives a usable initial parameterization whenever the graph approximation of geodesics on be faithful. These initial guesses, in turn, produce efficient free form optimization processes with minimal errors. Future work is required in further exploiting the usual triangular mesh underlying the point sample for (a) enhancing the segmentation of the point set into faces, and (b) using a more accurate approximation of the geodesic distances within , which would benefit its dimensionality reduction.
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
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
Modeling and simulation of an Underwater Remotely Operated Vehicle (ROV) for surveillance and inspection of port facilities using CFD tools
(2008-01-01) Valencia, R.A.; Ramírez, J.A.; Gutiérrez, L.B.; García, M.J.; Valencia, R.A.; Ramírez, J.A.; Gutiérrez, L.B.; García, M.J.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Mecánica Aplicada
This article presents theoretical and computational studies with Computational Fluids Dynamics (CFD) tools of an Underwater Remotely Operated Vehicle (ROV), required to obtain reliable visual information, used for surveillance and maintenance of ship shells and underwater structures of Colombian port facilities. The thrust force is analyzed at the operational conditions by using CFD tools (FLUENT™, CFX™, COSMOSFLOW™) and the information about forces, torques and power of the vehicle's thrusters is obtained. The commercial propellers were modeled by using a reverse engineering process with a 3D scanner and Computer Aided Design (CAD) software (RAPIDFORM™). The results obtained with the CFD package allowed to evaluate several operating scenarios of the vehicle that are used for feedback purposes in the design process of the ROV before it be manufactured. Copyright © 2008 by ASME.
Parametric curve reconstruction from point clouds using minimization techniques
(2013-01-01) Ruiz, O.E.; Cortés, C.; Aristizábal, M.; Acosta, D.A.; Vanegas, C.A.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
Curve reconstruction from noisy point samples is central to surface reconstruction and therefore to reverse engineering, medical imaging, etc. Although Piecewise Linear (PL) curve reconstruction plays an important role, smooth (C1-, C2-,?) curves are needed for many applications. In reconstruction of parametric curves from noisy point samples there remain unsolved issues such as (1) high computational expenses, (2) presence of artifacts and outlier curls, (3) erratic behavior of self-intersecting curves, and (4) erratic excursions at sharp corners. Some of these issues are related to non-Nyquist (i.e. sparse) samples. In response to these shortcomings, this article reports the minimization-based fitting of parametric curves for noisy point clouds. Our approach features: (a) Principal Component Analysis (PCA) pre-processing to obtain a topologically correct approximation of the sampled curve. (b) Numerical, instead of algebraic, calculation of roots in point-to-curve distances. (c) Penalties for curve excursions by using point cloud to - curve and curve to point cloud. (d) Objective functions which are economic to minimize. The implemented algorithms successfully deal with self - intersecting and / or non-Nyquist samples. Ongoing research includes self-tuning of the algorithms and decimation of the point cloud and the control polygon.
Parametric curve reconstruction from point clouds using minimization techniques
(2013-01-01) Ruiz, O.E.; Cortés, C.; Aristizábal, M.; Acosta, D.A.; Vanegas, C.A.; Universidad EAFIT. Departamento de Ingeniería de Procesos; Desarrollo y Diseño de Procesos
Curve reconstruction from noisy point samples is central to surface reconstruction and therefore to reverse engineering, medical imaging, etc. Although Piecewise Linear (PL) curve reconstruction plays an important role, smooth (C1-, C2-,?) curves are needed for many applications. In reconstruction of parametric curves from noisy point samples there remain unsolved issues such as (1) high computational expenses, (2) presence of artifacts and outlier curls, (3) erratic behavior of self-intersecting curves, and (4) erratic excursions at sharp corners. Some of these issues are related to non-Nyquist (i.e. sparse) samples. In response to these shortcomings, this article reports the minimization-based fitting of parametric curves for noisy point clouds. Our approach features: (a) Principal Component Analysis (PCA) pre-processing to obtain a topologically correct approximation of the sampled curve. (b) Numerical, instead of algebraic, calculation of roots in point-to-curve distances. (c) Penalties for curve excursions by using point cloud to - curve and curve to point cloud. (d) Objective functions which are economic to minimize. The implemented algorithms successfully deal with self - intersecting and / or non-Nyquist samples. Ongoing research includes self-tuning of the algorithms and decimation of the point cloud and the control polygon.
Rediseño de un encaje para un usuario con amputación transfemoral con el uso de metodologías de ingeniería inversa
(2009-10-13) Villa Álvarez, Diana Pamela; García Flórez, Juan Alejandro
Sensitivity analysis in optimized parametric curve fitting
(EMERALD GROUP PUBLISHING LIMITED, 2015-03-02) Ruiz, Oscar E.; Cortes, Camilo; Acosta, Diego A.; Aristizabal, Mauricio; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
Purpose-Curve fitting from unordered noisy point samples is needed for surface reconstruction in many applications. In the literature, several approaches have been proposed to solve this problem. However, previous works lack formal characterization of the curve fitting problem and assessment on the effect of several parameters (i.e. scalars that remain constant in the optimization problem), such as control points number (m), curve degree (b), knot vector composition (U), norm degree (k ), and point sample size (r) on the optimized curve reconstruction measured by a penalty function ( f ). The paper aims to discuss these issues. Design/methodology/approach-A numerical sensitivity analysis of the effect of m, b, k and r on f and a characterization of the fitting procedure from the mathematical viewpoint are performed. Also, the spectral (frequency) analysis of the derivative of the angle of the fitted curve with respect to u as a means to detect spurious curls and peaks is explored. Findings-It is more effective to find optimum values for m than k or b in order to obtain good results because the topological faithfulness of the resulting curve strongly depends on m. Furthermore, when an exaggerate number of control points is used the resulting curve presents spurious curls and peaks. The authors were able to detect the presence of such spurious features with spectral analysis. Also, the authors found that the method for curve fitting is robust to significant decimation of the point sample. Research limitations/implications-The authors have addressed important voids of previous works in this field. The authors determined, among the curve fitting parameters m, b and k, which of them influenced the most the results and how. Also, the authors performed a characterization of the curve fitting problem from the optimization perspective. And finally, the authors devised a method to detect spurious features in the fitting curve. Practical implications-This paper provides a methodology to select the important tuning parameters in a formal manner. Originality/value-Up to the best of the knowledge, no previous work has been conducted in the formal mathematical evaluation of the sensitivity of the goodness of the curve fit with respect to different possible tuning parameters (curve degree, number of control points, norm degree, etc.). © Emerald Group Publishing Limited.
Sensitivity analysis in optimized parametric curve fitting
(EMERALD GROUP PUBLISHING LIMITED, 2015-03-02) Ruiz, Oscar E.; Cortes, Camilo; Acosta, Diego A.; Aristizabal, Mauricio; Universidad EAFIT. Departamento de Ingeniería de Procesos; Desarrollo y Diseño de Procesos
Purpose-Curve fitting from unordered noisy point samples is needed for surface reconstruction in many applications. In the literature, several approaches have been proposed to solve this problem. However, previous works lack formal characterization of the curve fitting problem and assessment on the effect of several parameters (i.e. scalars that remain constant in the optimization problem), such as control points number (m), curve degree (b), knot vector composition (U), norm degree (k ), and point sample size (r) on the optimized curve reconstruction measured by a penalty function ( f ). The paper aims to discuss these issues. Design/methodology/approach-A numerical sensitivity analysis of the effect of m, b, k and r on f and a characterization of the fitting procedure from the mathematical viewpoint are performed. Also, the spectral (frequency) analysis of the derivative of the angle of the fitted curve with respect to u as a means to detect spurious curls and peaks is explored. Findings-It is more effective to find optimum values for m than k or b in order to obtain good results because the topological faithfulness of the resulting curve strongly depends on m. Furthermore, when an exaggerate number of control points is used the resulting curve presents spurious curls and peaks. The authors were able to detect the presence of such spurious features with spectral analysis. Also, the authors found that the method for curve fitting is robust to significant decimation of the point sample. Research limitations/implications-The authors have addressed important voids of previous works in this field. The authors determined, among the curve fitting parameters m, b and k, which of them influenced the most the results and how. Also, the authors performed a characterization of the curve fitting problem from the optimization perspective. And finally, the authors devised a method to detect spurious features in the fitting curve. Practical implications-This paper provides a methodology to select the important tuning parameters in a formal manner. Originality/value-Up to the best of the knowledge, no previous work has been conducted in the formal mathematical evaluation of the sensitivity of the goodness of the curve fit with respect to different possible tuning parameters (curve degree, number of control points, norm degree, etc.). © Emerald Group Publishing Limited.
Structural optimization of as-built parts using reverse engineering and evolution strategies
(SPRINGER, 2008-06-01) García, M.J.; Boulanger, P.; Henao, M.; García, M.J.; Boulanger, P.; Henao, M.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Mecánica Aplicada
In industry, some parts are prone to failures or their design is simply sub-optimal. In those critical situations, one would like to be able to make changes to the part, making it lighter or improving its mechanical resistance. The problem of as-built parts is that the original computer-aided design (CAD) model is not available or is lost. To optimize them, a reverse engineering process is necessary to capture the shape and topology of the original design. This paper describes how to capture the original design geometry using a semi-automated reverse engineering process based on measurement provided by an optical 3D sensor. Following this reverse engineering process, a Fixed Grid Finite Element method and evolutionary algorithms are used to find the optimum shape that will minimize stress and weight. Several examples of industrial parts are presented. These examples show the advantages and disadvantages of the proposed method in an industrial scenario. © 2007 Springer-Verlag Berlin Heidelberg.
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.
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.
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.

Examinando por Materia "Reverse engineering"

Resultados por página

Opciones de ordenación