3D mesh decomposition using protrusion and boundary part detection

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The number of 3D models is growing every day and the segmentation of such models has recently attracted a lot of attention. In this paper we propose a two-phase approach for segmentation of 3D models. We leverage a well-known fact from electrical physics about charge distribution for both initial protruding part extraction and boundary detection. The first phase tries to locate the initial protruding parts, which have higher charge density, while the second phase utilizes the minima rule and an area-based approach to find the boundary in the concave regions. The proposed approach has a great advantage over the similar approach proposed by Wu and Levine [1]; our approach can find boundaries for some joining parts not entirely located in the concave region which is not the case in the work of Wu and Levine. The experimental result on the McGill and SHREC 2007 datasets show promising results for partial matching in 3D model retrieval. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Alizadeh, F., & Sutherland, A. (2013). 3D mesh decomposition using protrusion and boundary part detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8048 LNCS, pp. 126–134). https://doi.org/10.1007/978-3-642-40246-3_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free