期刊文献+

基于简约束三角形剖分的果实表面模型重建 被引量:1

Reconstruction of fruits surface models based on simple constrained triangulation
下载PDF
导出
摘要 【目的】研究轮廓线三维表面模型重建中存在的嵌套、分叉和投影交叉等复杂轮廓的轮廓匹配问题。【方法】在定义轮廓距离基础上,制定了轮廓匹配的2条准则,构成拓扑结构简单的轮廓对,针对一对多且投影交叉的轮廓对,采用等比放大方法进行预处理,利用简约束算法对放大后的轮廓对进行剖分。用实际算例对提出的重建方法进行了验证。【结果】算例验证表明,提出的重建方法能快速进行拓扑结构复杂的轮廓剖分,重建合理的表面网格模型,重建只存在轮廓嵌套的南瓜模型需19.673ms,重建最复杂的莲藕模型需51.845ms。【结论】通过对果实MRI图像序列提取的轮廓进行剖分,能够快速进行果实表面重建。 【Objective】This paper attempted to remove the difficulties in contours matching due to some complex contour pairs with nests,branches,and projective intersections in the process of the contourbased three dimensional(3D) surface model reconstruction.【Method】On the basis of two defined contours distances,two criteria were proposed for contour matching to construct the simple contours pairs.A novel geometric amplification method was put forward to preprocess one-to-many contour pairs with projective intersections;the simple-constrained algorithm was applied to triangulate the amplified contour pairs.The proposed reconstruction method was validated with practical examples.【Result】The experimental results verify that the proposed method is able to achieve faster contours triangulation of the complex topologies,and reasonable reconstruction of mesh surface models.19.673ms was needed for the reconstruction of pumpkin model with contour nesting,and 51.845 ms for reconstruction of the most complex lotus model.【Conclusion】This paper proposed a novel method for fast surface models reconstruction of fruits by triangulating the contour pairs extracted from MRI image sequence.
出处 《西北农林科技大学学报(自然科学版)》 CSCD 北大核心 2012年第10期167-172,共6页 Journal of Northwest A&F University(Natural Science Edition)
基金 国家自然科学基金项目(60975007)
关键词 果实 表面模型 轮廓 简约束 三角剖分 fruit surface models contour simple-constrained algorithm triangulation
  • 相关文献

参考文献19

  • 1De B M,Cheong O,Kreveld M,et al. Computational geometry: algorithms and applications [M]. 3rd Edition. New York: Springer-Verlag, 2008 : 218-220.
  • 2耿楠,于伟,宁纪锋.基于水平集和先验信息的农业图像分割方法[J].农业机械学报,2011,42(9):167-172. 被引量:18
  • 3Hou S, Ramani K. Structure-oriented contour representation and matching for engineering shapes[J]. Computer-Aided De- sign,2008,40(1) :94-108.
  • 4Si W S, Zomaya A Y. New memoryless online routing algo- rithms for Delaunay triangulations [J]. IEEE Transactions on Parallel and Distributed Systems, 2012,23(8) : 1520-1527.
  • 5Biniaz A, Dastghaibyfard G. A faster circle-sweep Delaunay tri- angulation algorithm [J]. Advances in Engineering Software, 2012,43(1):1-13.
  • 6Ebeida M S, Mitchell S A, Davidson A A. Efficient and good Delaunay meshes from random points [ J ]. Computer Aided Design, 2011,43(11) : 1506-1515.
  • 7Pagnutti D, Ollivier G C. Two-dimensional Delaunay-based ani- sotropie mesh adaptation[J]. Engineering with Computers, 2010,26(4) :407-418.
  • 8Dey T K, Levine J A, Slatton A. Localized Delaunay refinement for sampling and meshing[J]. Computer Graphics Forum, 2010,29(5) : 1723-1732.
  • 9Zhou Y F,Sun F,Wang W P. Fast updating of Delaunay trian- gulation of moving points by hi-cell filtering [J]. Computer Graphics Forum,2010,29(7) :2233-2242.
  • 10Garanzha V A, Kudryavtseva L N. Generation of three-dimen- sional Delaunay meshes from weakly structured and inconsis- tent data [J]. Computational Mathematics and Mathematical Physics,2012,52(3) :427-447.

二级参考文献48

  • 1孙晓鹏,李华.三维网格模型的分割及应用技术综述[J].计算机辅助设计与图形学学报,2005,17(8):1647-1655. 被引量:49
  • 2Mangan A, Whitaker R. Partitioning 3D surface meshes using watershed segmentation[J].IEEE Transactions on Visualization and Computer Graphics, 1999, 5(4): 308-321.
  • 3Zuckerberger E, Tal A, Shlafman S. Polyhedral surface decomposition with applications [J].Computers & Graphics, 2002, 26(5): 733-743.
  • 4Katz S, Tal A. Hierarchical mesh decomposition using fuzzy clustering and cuts [J]. ACM Transactions on Graphics, 2003, 22(3): 954-961.
  • 5Lee Y, Lee S, Shamir A, et al. Intelligent mesh scissoring using 3D snakes [C]//Proceedings of the 12th Pacific Conference on Computer Graphics and Applications, Washington D C, 2004:279-287.
  • 6Shlafman S, Tal A, Katz S. Metamorphosis of polyhedral surfaces using decomposition [J]. Computer Graphics Forum, 2002, 21(3): 219-228.
  • 7Cohen Steiner D, Alliez P, Desbrun M. Variational shape approximation [J]. ACM Transactions on Graphics, 2004, 23(3) : 905-914.
  • 8Attene M, Falcidieno B, Spagnuolo M. Hierarchical mesh segmentation based on fitting primitives [J]. The Visual Computer, 2006, 22(3): 181-193.
  • 9Gelfand N, Guibas L J. Shape segmentation using local slippage analysis[C]//Proceedings of the Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, New York, 2004: 214-223.
  • 10Ni X, Garland M, Hart J C. Fair morse functions for extracting the topological structure of a surface mesh[J]. ACM Transactions on Graphics, 2004, 23(3): 613-622.

共引文献39

同被引文献1

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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