Examinando por Autor "Arroyave, S."
Mostrando 1 - 5 de 5
Resultados por página
Opciones de ordenación
Ítem EGCL: an extended G-Code Language with flow control, functions and mnemonic variables(World Academy of Science, Engineering and Technology (WASET), 2012) Ruíz, Óscar E.; Arroyave, S.; Cardona, J.F.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEIn the context of computer numerical control (CNC) and computer aided manufacturing (CAM), the capabilities of programming languages such as symbolic and intuitive programming, program portability and geometrical portfolio have special importance -- They allow to save time and to avoid errors during part programming and permit code re-usage -- Our updated literature review indicates that the current state of art presents voids in parametric programming, program portability and programming flexibility -- In response to this situation, this article presents a compiler implementation for EGCL (Extended G-code Language), a new, enriched CNC programming language which allows the use of descriptive variable names, geometrical functions and flow-control statements (if-then-else, while) -- Our compiler produces low-level generic, elementary ISO-compliant Gcode, thus allowing for flexibility in the choice of the executing CNC machine and in portability -- Our results show that readable variable names and flow control statements allow a simplified and intuitive part programming and permit re-usage of the programs -- Future work includes allowing the programmer to define own functions in terms of EGCL, in contrast to the current status of having them as library built-in functionsÍtem 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.Ítem 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 ProcesosReverse 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.Ítem 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/CAEReverse 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.Ítem 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 AplicacionesReverse 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.