Examinando por Materia "Geometry"
Mostrando 1 - 20 de 25
Resultados por página
Opciones de ordenación
Ítem A Riemannian Geometry in the q-Exponential Banach Manifold induced by q-Divergences.(Springer, 2013) Quiceno, H. R.; Loaiza, Gabriel; Universidad EAFIT. Escuela de Ciencias y Humanidades. Grupo de Investigación Análisis Funcional y Aplicaciones; Gabriel Loaiza (gloaiza@eafit.edu.co)For the family of non-parametric q-exponential statistical models, in a former paper, written by the same authors, a differentiable Banach manifold modelled on Lebesgue spaces of real random variables has been built. In this paper, the geometry induced on this manifold is characterized by q-divergence functionals. This geometry turns out to be a generalization of the geometry given by Fisher information metric and Levi-Civita connections. Moreover, the classical Amari’s α-connections appears as special case of the q −connections ∇ (q). The main result is the expected one, namely the zero curvature of the manifold.Ítem Adaptative cubical grid forisosurface extraction(2009-01-01) Congote, J.; Moreno, A.; Barandiaran, I.; Barandiaran, J.; Ruiz, O.E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis work proposes a variation on the Marching Cubes algorithm, where the goal is to represent implicit functions with higher resolution and better graphical qualiry using the same grid size. The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved. After each iteration, the difference betvveen the implicit and the explicit representations are reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more detailed, as the results shall confirm. The proposed algorithm corrects some topological problems that may appear in the discretisation process using the original grid.Ítem Algebraic geometry and group theory in geometric constraint satisfaction for computer-aided design and assembly planning(Taylor & Francis, 1996) Ruíz, Óscar E.; Ferreira, Placid M.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEMechanical design and assembly planning inherently involve geometric constraint satisfaction or scene feasibility (GCS/SF) problems -- Such problems imply the satisfaction of proposed relations placed between undefined geometric entities in a given scenario -- If the degrees of freedom remaining in the scene are compatible with the proposed relations or constraints, a set of entities is produced that populate the scenario satisfying the relations -- Otherwise, a diagnostic of inconsistency of the problem is emitted -- This problem appears in various forms in assembly planning (assembly model generation), process planning, constraint driven design, computer vision, etc -- Previous attempts at solution using separate numerical, symbolic or procedural approaches suffer serious shortcomings in characterizing the solution space, in dealing simultaneously with geometric (dimensional) and topological (relational) inconsistencies, and in completely covering the possible physical variations of the problem -- This investigation starts by formulating the problem as one of characterizing the solution space of a set of polynomials -- By using theories developed in the area of algebraic geometry, properties of Grobner Bases are used to assess the consistency and ambiguity of the given problem and the dimension of its solution space -- This method allows for die integration of geometric and topological reasoning -- The high computational cost of Grobner Basis construction and the need for a compact and physically meaningful set of variables lead to the integration of known results on group theory -- These results allow the characterization of geometric constraints in terms of the subgroups of the Special Group of Euclidean displacements in E^3, SE(3) -- Several examples arc developed which were solved with computer algebra systems (MAPLE and Mathematica) -- They are presented to illustrate the use of the Euclidean group-based variables, and to demonstrate the theoretical completeness of the algebraic geometry analysis over the domain of constraints expressible as polynomialsÍtem An algorithmic approach for simulating realistic irregular tilings(Universidad EAFIT, 2012) Betancourt Arango, Alejandro; Marín Sánchez, Freddy Hernán; Duque Cardona, Juan CarlosÍtem Efectos durante generación de hidrógeno en diferentes acabados geométricos de una superficie galvanizada con níquel(Universidad EAFIT, 2023) Lasprilla Holguín, David Ricardo; Ossa Henao, Edgar AlexánderIn the search for renewable energy sources, hydrogen production is an ideal alternative either because of its clean combustion without producing carbon dioxide or its long-term storage 5 capacity. Therefore, one of the methods used is water electrolysis, which is ideal for large-scale hydrogen production because it does not produce any carbon-based fuel by-product pollutants. The production of green hydrogen from water electrolysis using renewable sources such as solar or wind would facilitate long-term clean energy storage.Ítem Efficient solution for the diffraction of elastic SH waves by a wedge: Performance of various exact, asymptotic and simplified solutions(Elsevier Ltd, 2017-04-01) Aristizabal, V.H.; Velez, F.J.; Jaramillo, J.D.; Mecánica AplicadaThe diffraction of horizontally polarized shear waves by a semi-infinite wedge in frequency and time domains is studied. In particular, this work focus on the performance of different solutions, including the classical contributions from Macdonald, Sommerfeld and Kouyoumjian & Pathak. In addition, two fully analytical, simplified solutions are proposed using arguments from the so-called geometrical theory of diffraction. The main advantage of the two proposed solutions is the fact that the resulting solutions can be scaled to problems with arbitrary and complex geometries. Moreover, it is found that one of the proposed new solutions is highly efficient in terms of accuracy and computational speed as compared to alternative formulations (approximately 1000 times faster than the Macdonald and Kouyoumjian & Pathak solutions), thus, this important characteristic renders this solution ideal for implementation in GPUs (Graphics Processor Units) for multiscale modeling applications. © 2017 Elsevier LtdÍtem Ellipse-based principal component analysis for self-intersecting curve reconstruction from noisy point sets(SPRINGER, 2011-03-01) Ruiz, O.; Vanegas, C.; Cadavid, C.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAESurface reconstruction from cross cuts usually requires curve reconstruction from planar noisy point samples. The output curves must form a possibly disconnected 1-manifold for the surface reconstruction to proceed. This article describes an implemented algorithm for the reconstruction of planar curves (1-manifolds) out of noisy point samples of a self-intersecting or nearly self-intersecting planar curve C. C:[a,b]R?R 2 is self-intersecting if C(u)=C(v), u v, u,v (a,b) (C(u) is the self-intersection point). We consider only transversal self-intersections, i.e. those for which the tangents of the intersecting branches at the intersection point do not coincide (C (u)=C(v)). In the presence of noise, curves which self-intersect cannot be distinguished from curves which nearly self-intersect. Existing algorithms for curve reconstruction out of either noisy point samples or pixel data, do not produce a (possibly disconnected) Piecewise Linear 1-manifold approaching the whole point sample. The algorithm implemented in this work uses Principal Component Analysis (PCA) with elliptic support regions near the self-intersections. The algorithm was successful in recovering contours out of noisy slice samples of a surface, for the Hand, Pelvis and Skull data sets. As a test for the correctness of the obtained curves in the slice levels, they were input into an algorithm of surface reconstruction, leading to a reconstructed surface which reproduces the topological and geometrical properties of the original object. The algorithm robustly reacts not only to statistical non-correlation at the self-intersections (non-manifold neighborhoods) but also to occasional high noise at the non-self-intersecting (1-manifold) neighborhoods. © 2010 Springer-Verlag.Ítem Ellipse-based principal component analysis for self-intersecting curve reconstruction from noisy point sets(SPRINGER, 2011-03-01) Ruiz, O.; Vanegas, C.; Cadavid, C.; Ruiz, O.; Vanegas, C.; Cadavid, C.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y AplicacionesSurface reconstruction from cross cuts usually requires curve reconstruction from planar noisy point samples. The output curves must form a possibly disconnected 1-manifold for the surface reconstruction to proceed. This article describes an implemented algorithm for the reconstruction of planar curves (1-manifolds) out of noisy point samples of a self-intersecting or nearly self-intersecting planar curve C. C:[a,b]R?R 2 is self-intersecting if C(u)=C(v), u v, u,v (a,b) (C(u) is the self-intersection point). We consider only transversal self-intersections, i.e. those for which the tangents of the intersecting branches at the intersection point do not coincide (C (u)=C(v)). In the presence of noise, curves which self-intersect cannot be distinguished from curves which nearly self-intersect. Existing algorithms for curve reconstruction out of either noisy point samples or pixel data, do not produce a (possibly disconnected) Piecewise Linear 1-manifold approaching the whole point sample. The algorithm implemented in this work uses Principal Component Analysis (PCA) with elliptic support regions near the self-intersections. The algorithm was successful in recovering contours out of noisy slice samples of a surface, for the Hand, Pelvis and Skull data sets. As a test for the correctness of the obtained curves in the slice levels, they were input into an algorithm of surface reconstruction, leading to a reconstructed surface which reproduces the topological and geometrical properties of the original object. The algorithm robustly reacts not only to statistical non-correlation at the self-intersections (non-manifold neighborhoods) but also to occasional high noise at the non-self-intersecting (1-manifold) neighborhoods. © 2010 Springer-Verlag.Ítem Extending marching cubes with adaptative methods to obtain more accurate iso-surfaces(Springer Verlag, 2010-01-01) Congote, J.; Moreno, A.; Barandiaran, I.; Barandiaran, J.; Ruiz, O.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEThis work proposes an extension of the Marching Cubes algorithm, where the goal is to represent implicit functions with higher accuracy using the same grid size. The proposed algorithm displaces the vertices of the cubes iteratively until the stop condition is achieved. After each iteration, the difference between the implicit and the explicit representations is reduced, and when the algorithm finishes, the implicit surface representation using the modified cubical grid is more accurate, as the results shall confirm. The proposed algorithm corrects some topological problems that may appear in the discretization process using the original grid. © 2010 Springer-Verlag Berlin Heidelberg.Ítem Fixed grid meshing implementation for interactive analysis(Universidad EAFIT, 2012) Duque Lombana, Juan Fernando; García Ruiz, Manuel JulioÍtem Geometric constraint subsets and subgraphs in the analysis of assemblies and mechanisms(Universidad EAFIT, 2006-03) Ruíz, Óscar E.; Ferreira, Placid M.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEGeometric Reasoning ability is central to many applications in CAD/CAM/CAPP environments -- An increasing demand exists for Geometric Reasoning systems which evaluate the feasibility of virtual scenes specified by geometric relations -- Thus, the Geometric Constraint Satisfaction or Scene Feasibility (GCS/SF) problem consists of a basic scenario containing geometric entities, whose context is used to propose constraining relations among still undefined entities -- If the constraint specification is consistent, the answer of the problem is one of finitely or infinitely many solution scenarios satisfying the prescribed constraints -- Otherwise, a diagnostic of inconsistency is expected -- The three main approaches used for this problem are numerical, procedural or operational and mathematical -- Numerical and procedural approaches answer only part of the problem, and are not complete in the sense that a failure to provide an answer does not preclude the existence of one -- The mathematical approach previously presented by the authors describes the problem using a set of polynomial equations -- The common roots to this set of polynomials characterizes the solution space for such a problem -- That work presents the use of Groebner basis techniques for verifying the consistency of the constraints -- It also integrates subgroups of the Special Euclidean Group of Displacements SE(3) in the problem formulation to exploit the structure implied by geometric relations -- Although theoretically sound, these techniques require large amounts of computing resources -- This work proposes Divide-and-Conquer techniques applied to local GCS/SF subproblems to identify strongly constrained clusters of geometric entities -- The identification and preprocessing of these clusters generally reduces the effort required in solving the overall problem -- Cluster identification can be related to identifying short cycles in the Spatial Con straint graph for the GCS/SF problem -- Their preprocessing uses the aforementioned Algebraic Geometry and Group theoretical techniques on the local GCS/SF problems that correspond to these cycles -- Besides improving theefficiency of the solution approach, the Divide-and-Conquer techniques capture the physical essence of the problem -- This is illustrated by applying the discussed techniques to the analysis of the degrees of freedom of mechanismsÍtem Geometry and topology extraction and visualization from scalar and vector fields(Universidad EAFIT, 2013) Congote Calle, John Edgar; Ruíz Salguero, Óscar Eduardo; Posada, Jorge LeónÍtem Geometry as a tool for visual organisation and proportion in designing aesthetic and attractive products(2013-01-01) Velásquez, A.The goal of this paper is to present the teaching experiences and methodologies used in a Product Design Engineering undergraduate course called Design Project 3 (EAFIT University, Medellín - Colombia). Throughout the design process, there are some steps in which students have to make decisions for creating functional and also beautiful products. Geometric rules are applied during the drawing stages of the design process to define the visual configuration that gives order and structure to the product appearance, as well as the internal components of the mechanism, so students do not make random decisions and the configuration of functional and formal aspects of the product are correctly defined in a rational way. The size, position and space between parts are previously thought and strategically placed in the overall product shape, to obtain unity with a coherent aesthetic. Because of this, harmony, proportion, beauty and attractiveness are achieved. In this way, students feel more comfortable during the design process because the team can choose from among several proportions given to the same product. Dimensions, distances and proportions can be changed as many times as they want according to the different tools used, leading them towards a more beautiful product.Ítem Geometry simplification of open-cell porous materials for elastic deformation FEA(SPRINGER, 2019-01-01) Cortés C.; Osorno M.; Uribe D.; Steeb H.; Ruiz-Salguero O.; Barandiarán I.; Flórez J.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEEstimation of mechanical properties of porous materials is central for their medical and industrial application. However, the massive size of accurate boundary representations (B-Rep) of the foams makes the numerical estimations intractable. Even for small domain sizes, the mesh generation for finite element analysis (FEA) may not terminate. Current efforts for simulating porous materials use statistical predictions of the material structure. The simulated and actual materials present different geometry and topology, with consequences on the simulation results. To overcome these limitations, this manuscript presents a method, which (1) synthesizes an accurate truss abstraction from the raw geometry data, (2) executes efficient FEA simulations, and (3) processes nodal displacements to estimate apparent mechanical moduli of the porous material. The method addresses materials whose ligaments have circular cross-sections. The iso-surface present in the Computer Tomography (CT) scan of the porous material is used to synthesize a truss graph whose edges are truncated cones. Then, optimization and simplification methods are applied to produce a topologically and geometrically correct truss representation for the foam domain. Comparative FEA load simulations are conducted between the full B-Rep and truss representations of the material. The truss model proves to be significantly more efficient for FEA, departing from the Full B-Rep FEA by a maximum of 16% in the estimation of equivalent mechanical moduli. Geometric assessments such as porosity and Hausdorff distance confirm that the truss abstraction is a cost-effective one. Ongoing efforts concentrate on point set geometric algorithms for enforcement of standardized material testing. © 2018 Springer-Verlag London Ltd., part of Springer NatureÍtem Hessian eigenfunctions for triangular mesh parameterization(SciTePress, 2016-02-27) Mejia, D.; Ruiz OE; Cadavid, C.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEHessian Locally Linear Embedding (HLLE) is an algorithm that computes the nullspace of a Hessian functional H for Dimensionality Reduction (DR) of a sampled manifold M. This article presents a variation of classic HLLE for parameterization of 3D triangular meshes. Contrary to classic HLLE which estimates local Hessian nullspaces, the proposed approach follows intuitive ideas from Differential Geometry where the local Hessian is estimated by quadratic interpolation and a partition of unity is used to join all neighborhoods. In addition, local average triangle normals are used to estimate the tangent plane TxM at x ? M instead of PCA, resulting in local parameterizations which reflect better the geometry of the surface and perform better when the mesh presents sharp features. A high frequency dataset (Brain) is used to test our algorithm resulting in a higher rate of success (96.63%) compared to classic HLLE (76.4%). © Copyright 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.Ítem Hessian eigenfunctions for triangular mesh parameterization(SciTePress, 2016-02-27) Mejia, D.; Ruiz OE; Cadavid, C.; Mejia, D.; Ruiz OE; Cadavid, C.; Universidad EAFIT. Departamento de Ciencias; Matemáticas y AplicacionesHessian Locally Linear Embedding (HLLE) is an algorithm that computes the nullspace of a Hessian functional H for Dimensionality Reduction (DR) of a sampled manifold M. This article presents a variation of classic HLLE for parameterization of 3D triangular meshes. Contrary to classic HLLE which estimates local Hessian nullspaces, the proposed approach follows intuitive ideas from Differential Geometry where the local Hessian is estimated by quadratic interpolation and a partition of unity is used to join all neighborhoods. In addition, local average triangle normals are used to estimate the tangent plane TxM at x ? M instead of PCA, resulting in local parameterizations which reflect better the geometry of the surface and perform better when the mesh presents sharp features. A high frequency dataset (Brain) is used to test our algorithm resulting in a higher rate of success (96.63%) compared to classic HLLE (76.4%). © Copyright 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.Ítem Marching cubes in an unsigned distance field for surface reconstruction from unorganized point sets(INSTICC-INST SYST TECHNOLOGIES INFORMATION CONTROL & COMMUNICATION, 2010-01-01) Congote, J.; Moreno, A.; Barandiaran, I.; Barandiaran, J.; Posada, J.; Ruiz, O.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAESurface reconstruction from unorganized point set is a common problem in computer graphics. Generation of the signed distance field from the point set is a common methodology for the surface reconstruction. The reconstruction of implicit surfaces is made with the algorithm of marching cubes, but the distance field of a point set can not be processed with marching cubes because the unsigned nature of the distance. We propose an extension to the marching cubes algorithm allowing the reconstruction of 0-level iso-surfaces in an unsigned distance field. We calculate more information inside each cell of the marching cubes lattice and then we extract the intersection points of the surface within the cell then we identify the marching cubes case for the triangulation. Our algorithm generates good surfaces but the presence of ambiguities in the case selection generates some topological mistakes.Ítem Objetos de la geometría algebraica clásica y espacios anillados(Universidad EAFIT, 2002) Cadavid Moreno, Carlos Alberto; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAELa Geometría Algebraica Clásica puede ser definida como el estudio de las variedades cuasiafines y cuasiproyectivas sobre un campo k, y en particular, del problema de su clasificación salvo isomorfismos -- Estas variedades son, por definición, subconjuntos de los n-espacios afínes y de los n-espacios proyectivos -- Es útil tener a disposición una definición intrínseca de estos objetos, es decir, independiente de un espacio ambiente -- En este artículo se muestra como la noción de Espacio Anillado es la clave para formular estas definiciones y reformular el problema de clasificaciónÍtem On a minimal factorization conjecture(Elsevier, 2007-08) Cadavid, Carlos A.; Vélez, Juan D.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAELet be a proper holomorphic map from a connected complex surface S onto the open unit disk D⊂C, with 0∈D as its unique singular value, and having fiber genus g>0 -- Assume that in case g⩾2, admits a deformation whose singular fibers are all of simple Lefschetz type -- It has been conjectured that the factorization of the monodromy f∈M around ϕ (0) in terms of righ-thanded Dehn twists induced by the monodromy of has the least number of factors among all possible factorizations of f as a product of righthanded Dehn twists in the mapping class group (see [M. Ishizaka, One parameter families of Riemann surfaces and presentations of elements of mapping class group by Dehn twists, J. Math. Soc. Japan 58 (2) (2006) 585–594]) -- In this article, the validity of this conjecture is established for g=1Ítem Potenciación(Universidad EAFIT, 2015) Esteban Duarte, Pedro Vicente; Esteban Duarte, Pedro Vicente. Universidad EAFIT, Escuela de Ciencias, Ciencias Básicas, Medellín, Colombia; Proyecto 50En matemáticas existen operaciones básicas que son fundamentales para la solución de diversos problemas -- Una de ellas es la potenciación, que consiste en el producto repetido o multiplicación sucesiva del mismo término -- Geométricamente, cuando un factor se multiplica consigo mismo dos veces, se asocia con el área de un cuadrado; si se multiplica tres veces, se asocia con el volumen de un cubo -- De esta forma, la potenciación se asocia con diversas situaciones -- En el presente taller se estudian propiedades y operaciones que se realizan con la potenciación -- Este módulo tiene los siguientes objetivos