.png){kind=icon}
返回
Mesh segmentation based on curvatures using the GPU
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-014-2104-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proposes an efficient algorithm for decomposition of a 3D arbitrary triangular mesh into surface patches. Our method is based on the discrete curvatures for an accurate partitioning criterion and presents a fast clustering scheme of vertices using quick shift algorithm. It was implemented on the GPU (Graphics Processing Unit) because it is common for object geometry to exist in graphic memory so that more computational work is done directly on the graphic device. The proposed method results in fast estimation of curvatures and high quality of mesh segmentation. Also we applied it to NPR drawing of 3D meshes.
Keyword:
Mesh segmentation
Discrete curvatures
Quick shift
GP-GPU programming
CUDA
期刊
IF:
3
论文数:
2.0W
被引数:
3.2W
机构
引用论文
Interclass testing of object oriented software.png)
Eighth IEEE International Conference on Engineering of Complex Computer Systems, 2002. Proceedings.
OAAI
Eighth IEEE International Conference on Engineering of Complex Computer Systems, 2002. Proceedings.IF0
OAAI分享收藏
分享收藏Estimating curvatures and their derivatives on meshes of arbitrary topology from sampling directionsVISUAL COMPUTER
VISUAL COMPUTERIF2.9
PREAI
分享收藏
查看更多内容