A fast mesh segmentation algorithm based on tensor voting

DOI10.3785/J.ISSN.1008-973X.2011.06.006MaRDI QIDQ2886123zbMATH OpenOpenAlexFDO

Authors Zhenyu Shu, Guozhao Wang

Publication date 1 June 2012

Published in Journal of Zhejiang University. Engineering Science (Search for Journal in Brave)

Full work available at URL https://en.cnki.com.cn/Article_en/CJFDTOTAL-ZDZC201106005.htm

zbMATH Keywords

algorithmclusteringenergy minimizationgeometrical featuremesh segmentationnumerical examplestensor voting theory

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Recommendations

• Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy
• A part segmentation algorithm for triangular mesh based on Poisson shape signature
• Mesh segmentation based on mesh parameterization techniques
• A fast and efficient mesh segmentation method based on improved region growing
• scientific article; zbMATH DE number 5525353

Cited in

(6)

• Volumetric shape contexts for mesh co-segmentation
• A fast and efficient mesh segmentation method based on improved region growing
• Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy
• Optimal sampling algorithm for seed points in triangular mesh segmentation
• A part segmentation algorithm for triangular mesh based on Poisson shape signature
• Mesh segmentation based on mesh parameterization techniques

This page was built for publication: A fast mesh segmentation algorithm based on tensor voting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2886123)