Examinando por Materia "Motion planning"

Mostrando 1 - 4 de 4
  • No hay miniatura disponible
    Ítem
    Fast analytic simulation for multi-laser heating of sheet metal in GPU
    (MDPI AG, 2018-11-01) Mejia-Parra D.; Montoya-Zapata D.; Arbelaiz A.; Moreno A.; Posada J.; Ruiz-Salguero O.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAE
    Interactive multi-beam laser machining simulation is crucial in the context of tool path planning and optimization of laser machining parameters. Current simulation approaches for heat transfer analysis (1) rely on numerical Finite Element methods (or any of its variants), non-suitable for interactive applications; and (2) require the multiple laser beams to be completely synchronized in trajectories, parameters and time frames. To overcome this limitation, this manuscript presents an algorithm for interactive simulation of the transient temperature field on the sheet metal. Contrary to standard numerical methods, our algorithm is based on an analytic solution in the frequency domain, allowing arbitrary time/space discretizations without loss of precision and non-monotonic retrieval of the temperature history. In addition, the method allows complete asynchronous laser beams with independent trajectories, parameters and time frames. Our implementation in a GPU device allows simulations at interactive rates even for a large amount of simultaneous laser beams. The presented method is already integrated into an interactive simulation environment for sheet cutting. Ongoing work addresses thermal stress coupling and laser ablation. © 2018 by the authors.
  • 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.