Fiedler trees for multiscale surface analysis
نویسندگان
چکیده
In this work we introduce a new hierarchical surface decomposition method for multiscale analysis of surface meshes. In contrast to other multiresolution methods, our approach relies on spectral properties of the surface to build a binary hierarchical decomposition. Namely, we utilize the first nontrivial eigenfunction of the Laplace-Beltrami operator to recursively decompose the surface. For this reason we coin our surface decomposition the Fiedler tree. Using the Fiedler tree ensures a number of attractive properties, including: mesh-independent decomposition, well-formed and nearly equi-areal surface patches, and noise robustness. We show how the evenly distributed patches can be exploited for generating multiresolution high quality uniform meshes. Additionally, our decomposition permits a natural means for carrying out wavelet methods, resulting in an intuitive method for producing featuresensitive meshes at multiple scales. Keywords—multiscale representation; multiresolution shape analysis; surface partition
منابع مشابه
On the flexural properties of multiscale nanosilica/E-glass/epoxy anisogrid-stiffened composite panels
In the present study, multiscale nanosilica/E-glass/epoxy anisogrid composite panels were investigated for flexural properties as a function of nanosilica loading in the matrix (0, 1, 3 and 5 wt.%). The surface of the silica nanoparticles was firstly modified with 3-glycidoxypropyltrimethoxysilane (3-GPTS). The fourier transform infrared (FTIR) spectroscopy revealed that the organic functional ...
متن کاملMultiscale Analysis of Transverse Cracking in Cross-Ply Laminated Beams Using the Layerwise Theory
A finite element model based on the layerwise theory is developed for the analysis of transverse cracking in cross-ply laminated beams. The numerical model is developed using the layerwise theory of Reddy, and the von Kármán type nonlinear strain field is adopted to accommodate the moderately large rotations of the beam. The finite element beam model is verified by comparing the present numeric...
متن کاملFiedler Vectors and Elongation of Graphs: A Threshold Phenomenon on a Particular Class of Trees
Let G be a graph. Its laplacian matrix L(G) is positive and we consider eigenvectors of its first non-null eigenvalue that are called Fiedler vector. They have been intensively used in spectral partitioning problems due to their good empirical properties. More recently Fiedler vectors have been also popularized in the computer graphics community to describe elongation of shapes. In more technic...
متن کاملMultiscale Image Segmentation Using Joint Texture and Shape Analysis
We develop a general framework to simultaneously exploit texture and shape characterization in multiscale image segmentation. By posing multiscale segmentation as a model selection problem, we invoke the powerful framework ooered by minimum description length (MDL). This framework dictates that multiscale segmentation comprises multiscale texture characterization and multiscale shape coding. An...
متن کاملUltrametric sets in Euclidean point spaces
Finite sets S of points in a Euclidean space the mutual distances of which satisfy the ultrametric inequality (A;B) maxf (A;C); (C;B)g for all points in S are investigated and geometrically characterized. Inspired by results on ultrametric matrices and previous results on simplices, connections with so-called centered metric trees as well as with strongly isosceles right simplices are found. AM...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Graphics
دوره 34 شماره
صفحات -
تاریخ انتشار 2010