An efficient and robust algorithm for 3D mesh segmentation

Authors:
Lijun Chen;Nicolas D. Georganas
Affiliations:
School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada K1N 6N5;School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada K1N 6N5
Venue:
Multimedia Tools and Applications
Year:
2006

Citing 0
Cited 8

Automatic recognition of features from freeform surface CAD models

Computer-Aided Design
Region-based 3D Mesh Compression Using an Efficient Neighborhood-based Segmentation

Simulation
Automatic Detection of the Back Valley on Scoliotic Trunk Using Polygonal Surface Curvature

ICIAR '08 Proceedings of the 5th international conference on Image Analysis and Recognition
3D shape recursive decomposition by Poisson equation

Pattern Recognition Letters
An Automatic Three-Dimensional Fuzzy Edge Detector

WILF '09 Proceedings of the 8th International Workshop on Fuzzy Logic and Applications
A hybrid approach for grasping 3D objects

IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
A new strategy combining empirical and analytical approaches for grasping unknown 3D objects

Robotics and Autonomous Systems
Segmentation of DT-MRI anisotropy isosurfaces

EUROVIS'07 Proceedings of the 9th Joint Eurographics / IEEE VGTC conference on Visualization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an efficient and robust algorithm for 3D mesh segmentation. Segmentation is one of the main areas of 3D object modeling. Most segmentation methods decompose 3D objects into parts based on curvature analysis. Most of the existing curvature estimation algorithms are computationally costly. The proposed algorithm extracts features using Gaussian curvature and concaveness estimation to partition a 3D model into meaningful parts. More importantly, this algorithm can process highly detailed objects using an eXtended Multi-Ring (XMR) neighborhood based feature extraction. After feature extraction, we also developed a fast marching watershed-based segmentation algorithm followed by an efficient region merging scheme. Experimental results show that this segmentation algorithm is efficient and robust.