Documento de conferencia
URI permanente para esta colección
Examinar
Examinando Documento de conferencia por Autor "Acosta, Diego A."
Mostrando 1 - 2 de 2
Resultados por página
Opciones de ordenación
Ítem Graphs of optimally fit features in assessment of geometric tolerances(2014) Ruíz, Óscar E.; Congote, John; Acosta, Diego A.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis article presents an industrial application case of geometric constraint graphs, whose nodes are statistically optimal instances of manufacturing or design features and whose edges are usual geometric relations used in tolerance applications -- The features might be virtual ones -- As a consequence, they may lie beyond the piece’s extents -- The geometric constraint graph may have cyclic topology -- Contrary to deterministic geometric constraint graphs, tolerance constraint graphs admit numerical slacks, due to their stochastic nature -- The methodology has been applied in industrial scenarios, showing superiority to traditional material features for the assessment of tolerancesÍ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