Documento de conferencia
URI permanente para esta colección
Examinar
Examinando Documento de conferencia por Autor "Aristizábal, M."
Mostrando 1 - 3 de 3
Resultados por página
Opciones de ordenación
Ítem Force-Displacement Model of Compliant Mechanisms using Assur Sub-Chains(2011-06) Durango, S.; Correa, J.; Ruíz, O.; Aristizábal, M.; Restrepo-Giraldo, J.; Achiche, S.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis article develops a modular procedure to perform force-displacement modeling of planar flexurebased compliant mechanisms (CMs) -- The procedure is mostly suitable for planar lumped CMs -- To achieve the position analysis of CMs requires: (i) to implement the kinematic analysis as for ordinary mechanisms, (ii) to solve equilibrium problem by means of an static analysis and (iii) to model the flexures behavior through a deflection analysis -- The novel contribution of this article relies on the fact that a division strategy of the CM into Assur subchainsm is implemented, so that any CM subjected to such disaggregation can be accurately modeled -- For this purpose a mathematical model for leaf-spring flexure type is presented and used through this paper -- However any other flexure model can be used instead -- To support the technique, a three Degrees–Of–Freedom (3-DOF) flexure-based parallel mechanism is used as case study -- Results are compared to a Finite Element Analysis (FEA)Ítem Parametric Curve Reconstruction from Point Clouds using Minimization Techniques(SCITEPRESS, 2013) Ruíz, Óscar E.; Cortés, C.; Aristizábal, M.; Acosta, Diego A.; Vanegas, Carlos A.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAESmooth (C1-, C2-,...) curve reconstruction from noisy point samples is central to reverse engineering, medical imaging, etc -- Unresolved issues in this problem are (1) high computational expenses, (2) presence of artifacts and outlier curls, (3) erratic behavior at self-intersections and sharp corners -- Some of these issues are related to non-Nyquist (i.e. sparse) samples -- Our work reconstructs curves by minimizing the accumulative distance curve cs. point sample -- We address the open issues above by using (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Ítem 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/CAECurve 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.