Open AccessAutomatic Spectral Method of Mesh Segmentation Based on Fiedler Residual
Author(s) -
Lingfei LI,
Tieru WU
Publication year - 2021
Publication title -
chinese journal of electronics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.267
H-Index - 25
eISSN - 2075-5597
pISSN - 1022-4653
DOI - 10.1049/cje.2020.11.001
Subject(s) - polygon mesh , eigenvalues and eigenvectors , computer science , residual , segmentation , algorithm , mathematical optimization , mathematics , artificial intelligence , pattern recognition (psychology) , physics , computer graphics (images) , quantum mechanics
In this paper, we propose a fully automatic mesh segmentation method, which divides meshes into sub‐meshes recursively through spectral analysis. A common problem in the spectral analysis of geometric processing is how to choose the specific eigenvectors and the number of these vectors for analysis and processing. This method tackles this problem with only one eigenvector, i.e. Fiedler vector. In addition, using only one eigenvector drastically reduces the cost of computing. Different from the Fiedler vector commonly used in the bipartition of graphs and meshes, this method finds multiple parts in only one iteration, vastly reducing the number of iterations and thus the time of operation, because each iteration produces as many correct boundaries as possible, instead of only one. We have tested this method on many 3D models, the results of which suggest the proposed method performs better than many advanced methods of recent years.