Fast mesh segmentation by approzimated spherical patches
In this paper, we present a fast method for segmentation of triangular mesh surfaces into simple patches, where each patch is an approximation of a part of spherical surface. Given a mesh surface, all triangles of it cluster to a user-specified number of patches by energy minimization. All patches of result meshes are as spherical as possible with our algorithm. Experimental results show that our algorithm is efficient and robust.
Mesh segmentation Spherical surface Clustering
Zhenyu Shu Guozhao Wang
Institute of Computer Graphics and Image Processing, Department of Mathematics, Zhejiang University, Institute of Computer Graphics and Image Processing, Department of Mathematics, Zhejiang University,
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
3062-3065
2009-06-17(万方平台首次上网日期,不代表论文的发表时间)