期刊文献+

基于区域生长的网格模型分割 被引量:8

Mesh model segmentation based on region growth
下载PDF
导出
摘要 提出一种新的方法-基于法向量差值的区域生长,还提出了在候选种子中选择种子的方法,根据一种新的二面角的公式即法向量面积加权的差值进行区域生长,分割后对面积过小的面片区域进行优化处理。实验表明该方法快速有效。 A new region growth based on segmentation algorithm is proposed.The method is on the basis of the difference of normal and choosing the seeds from the candidates.A new formula,the difference of normal with the area,is taken as the criterion of region growth.Small patch is optimized after segmentation.Experiments illustrate that this algorithm is fast and effective.
出处 《计算机工程与应用》 CSCD 北大核心 2008年第31期84-86,共3页 Computer Engineering and Applications
关键词 网格 分割 种子 区域生长聚类 mesh segmentation seed region growth cluster
  • 相关文献

参考文献18

  • 1Shamir A.A formulation of boundary mesh segmentation [C]//Proc 2nd International Symposium on 3D Data Processing,Visualization, and Transmission, 2004.
  • 2全红艳,张田文.基于区域生长的网格模型分割技术[J].计算机辅助设计与图形学学报,2006,18(7):1011-1016. 被引量:19
  • 3Mangan A,Whitaker R.Partitioning 3D surface meshes using watershed segmentation[J].IEEE Transactions on Visualization and Computer Graphics, 1999,5 (4) : 308-321.
  • 4Chazelle B,Dobkin D,Shourhura N,et al.Strategies for polyhedral surface decomposition:an experimental study[J].Computational Geometry:Theory and Applications, 1997,7:327-342.
  • 5Sander P V,Wood Z J,Gortler S J,et al.Multi-chart geometry images[C]//Proc Symposium on Geometry Processing, 2003 : 146-155.
  • 6Shlafman S,Tal A,Katz S.Metamorphosis of polyhedral surfaces using decomposition[C]//Proceedings Eurographics,Computer Graphics Forum,2002,21 (3).
  • 7Alpert C,Yao S.Spectral partitioning:the more eigenvectors,the better[C]//32nd ACM/IEEE Design Automation Conference,San Francisco, 1995 : 195-200.
  • 8Li X,Toon T,Tan T,et al.Decomposing polygon meshes for interactive applications[C]//Proceedings of the 2001 Symposium on Interactive 3D Graphics,2001:35-42.
  • 9Hilaga M,Shinagawa Y,Komura T,et al.Topology matching for fully automatic similarity estimation of 3D shapes[C]//Computer Graphics Proceedings,Annual Con Reference Series,ACM SIGGRAPH, Los Angeles,California,2001:203-212.
  • 10Guskov I, Swddens W,Schrcoder P.Multiresolution signal processing for meshes[C]//Proceedings of SIGGRAPH 99.Los Angeles: ACM, 1999 : 325-334.

二级参考文献73

  • 1孙晓鹏,李华.三维网格模型的分割及应用技术综述[J].计算机辅助设计与图形学学报,2005,17(8):1647-1655. 被引量:49
  • 2Sebastian T B, Klein P N, Kimia B. Recognition of shapes by editing shock graphs [A]. In: Proceedings of IEEE International Conference on Computer Vision, Vanconver,2001. 755~762.
  • 3Sethian J A. Level Set Methods and Fast Marching Methods:Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Materials Science [M].Cambridge: Cambridge University Press, 2000.
  • 4Edelsbrunner H, Letscher D, Zomorodian A. Topological persistence and simplification [A]. In: Proceedings of the 41st Annual Symposium on Foundations of Computer Science,Redondo Beach, California, 2000. 454~463.
  • 5Hoppe H. Progressive meshes [A]. In: Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH,New Orleans, Louisiana, 1996. 99~108.
  • 6Bischoff S, Kobbelt L. Towards robust broadcasting of geometry data [J]. Computers & Graphics, 2002, 26(5): 665~ 675.
  • 7Zuckerberger E, Tal A, Shlafman S. Polyhedral surface decomposition with applications [J ]. Computers & Graphics,2002, 26(5): 733~743.
  • 8Garland M, Willmott A, Heckbert P. Hierarchical face clustering on polygonal surfaces [A]. In: Proceedings of ACM Symposium on Interactive 3D Graphics, Research Triangle Park, North Carolina, 2001. 49~58.
  • 9Praun Emil, Hoppe Hugues, Finkelstein Adam. Robust mesh watermarking [A]. In: Computer Graphics Proceedings,Annual Conference Series, ACM SIGGRAPH, Los Angeles,California, 1999. 49~56.
  • 10Krishnamurthy V, Levoy M. Fitting smooth surfaces to dense polygon meshes [A]. In: Computer Graphics Proceedings,Annual Conference Series, ACM SIGGRAPH, New Orleans,Louisiana, 1996. 313~324.

共引文献63

同被引文献60

引证文献8

二级引证文献16

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部