Issue No. 07 - July (2012 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2011.131
Oscar Kin-Chung Au , The City University of Hong Kong, Hong Kong
Youyi Zheng , The Hong Kong University of Science and Technology, Hong Kong
Menglin Chen , The Hong Kong University of Science and Technology, Hong Kong
Pengfei Xu , The Hong Kong University of Science and Technology, Hong Kong
Chiew-Lan Tai , The Hong Kong University of Science and Technology, Hong Kong
This paper presents a simple and efficient automatic mesh segmentation algorithm that solely exploits the shape concavity information. The method locates concave creases and seams using a set of concavity-sensitive scalar fields. These fields are computed by solving a Laplacian system with a novel concavity-sensitive weighting scheme. Isolines sampled from the concavity-aware fields naturally gather at concave seams, serving as good cutting boundary candidates. In addition, the fields provide sufficient information allowing efficient evaluation of the candidate cuts. We perform a summarization of all field gradient magnitudes to define a score for each isoline and employ a score-based greedy algorithm to select the best cuts. Extensive experiments and quantitative analysis have shown that the quality of our segmentations are better than or comparable with existing state-of-the-art more complex approaches.
Concavity-aware field, mesh segmentation, isolines.
C. Tai, M. Chen, P. Xu, Y. Zheng and O. K. Au, "Mesh Segmentation with Concavity-Aware Fields," in IEEE Transactions on Visualization & Computer Graphics, vol. 18, no. , pp. 1125-1134, 2011.