Examinando por Materia "Laplace transformation"
Mostrando 1 - 3 de 3
Resultados por página
Opciones de ordenación
Ítem Estudio de los procesos homogéneos y no homogéneos asociados al comportamiento de la confiabilidad en los sistemas reparables(Universidad EAFIT, 2007) Gómez Rueda, Mario Sergio; Vallejo Jaramillo, Juan SantiagoÍtem On the critical point structure of eigenfunctions belonging to the first nonzero eigenvalue of a genus two closed hyperbolic surface(2012-05-30) Cadavid, Carlos A.; Osorno, María C.; Ruíz, Óscar E.; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEWe develop a method based on spectral graph theory to approximate the eigenvalues and eigenfunctions of the Laplace-Beltrami operator of a compact riemannian manifold -- The method is applied to a closed hyperbolic surface of genus two -- The results obtained agree with the ones obtained by other authors by different methods, and they serve as experimental evidence supporting the conjectured fact that the generic eigenfunctions belonging to the first nonzero eigenvalue of a closed hyperbolic surface of arbitrary genus are Morse functions having the least possible total number of critical points among all Morse functions admitted by such manifoldsÍtem Spectral-based mesh segmentation(Springer Paris, 2016) Mejía, Daniel; Cadavid, Carlos A.; Ruíz-Salguero, Óscar; Universidad EAFIT. Departamento de Ingeniería Mecánica; Laboratorio CAD/CAM/CAEIn design and manufacturing, mesh segmentation is required for FACE construction in boundary representation (BRep), which in turn is central for featurebased design, machining, parametric CAD and reverse engineering, among others -- Although mesh segmentation is dictated by geometry and topology, this article focuses on the topological aspect (graph spectrum), as we consider that this tool has not been fully exploited -- We preprocess the mesh to obtain a edgelength homogeneous triangle set and its Graph Laplacian is calculated -- We then produce a monotonically increasing permutation of the Fiedler vector (2nd eigenvector of Graph Laplacian) for encoding the connectivity among part feature submeshes -- Within the mutated vector, discontinuities larger than a threshold (interactively set by a human) determine the partition of the original mesh -- We present tests of our method on large complex meshes, which show results which mostly adjust to BRep FACE partition -- The achieved segmentations properly locate most manufacturing features, although it requires human interaction to avoid over segmentation -- Future work includes an iterative application of this algorithm to progressively sever features of the mesh left from previous submesh removals