期刊文献+

基于照片序列快速三维表面网格模型的生成算法

Fast polyhedral surface mesh generation algorithm for 3D objects based on 2D photo images
在线阅读 下载PDF
导出
摘要 针对传统的基于体素的重构方法复杂度高、信息利用不充分的问题,提出了基于光线求交的三维表面多边形网格模型的生成算法,一方面使得点的生成复杂度仅与物体表面积相关,另一方面物体的空间结构信息在点重构过程中被记录下来,用于多边形网格的生成,避免了传统算法中将表面点集完全作为散乱点处理所造成的信息浪费,在不损失精度的情况下,大大减少了重构网格模型所需的时间. The traditional 3D modeling methods based on volumetric elements with complexities proportional to the volume,were not applicable to huge- volume objects. Since the result of a volumetric computation was a discrete 3D points set short of topology information,some triangulation methods were necessary to obtain the surface mesh from a set af scattered points. A new technique of 3D modeling based on the intersection of rays was represented,to reduce the complexity of point reconstruction from volume proportional to surface area proportional. Instead of treating points- reconstruction and triangulation as two separate procedures,the surface mesh of the object can be recovered from the topological information recorded during the computation process which reduces the computing time of the modeling. Hence the amount of computation required for triangulation is greatly reduced.
作者 陈越 裴玉茹
出处 《浙江大学学报(工学版)》 EI CAS CSCD 北大核心 2003年第5期537-542,共6页 Journal of Zhejiang University:Engineering Science
关键词 计算机图形学 图像重建 三维表面网格模型 照片序列 生成算法 光线跟踪 3D reconstruction ray tracing surface mesh photo images
  • 相关文献

参考文献10

  • 1陈越,余峰.从二维系列摄影图片提取剪影重构三维实体的光线跟踪算法[J].中国图象图形学报(A辑),2002,7(8):806-813. 被引量:4
  • 2陈越,杨文娴,王光宇.从二维图片重构凸单连通三维实体的快速算法[J].浙江大学学报(工学版),2002,36(5):526-530. 被引量:2
  • 3NIEM W. Robust and fast modeling of 3D natural objects from multiple views [J]. SPIE, 1994,2182:388--397.
  • 4LAURENTINI A. The visual hull concept for silhouette based image understanding [J]. IEEE PAMI,1994,16(2): 150--162.
  • 5SZELISKI R. Rapid octree construction from image sequences [J]. CVGIP: Image Under-standing, 1993,58(1): 23--32.
  • 6POTMESIL M. Generating octree models of 3D objects from their silhouettes in a sequence of images [J].CVGIP,1987,40: 1--29.
  • 7BALABAN I J. An optimal algorithm for finding segments intersections[A]. Proc 11th Annual, ACM Symposium on Computational Geometry[C]. Vancouver: ACM, 1995. 211--219.
  • 8HILLMAN G R. Three-dimensional reconstruction of irregular shapes based on a fitted mesh of contours[J].Image and Vision Computing, 2001,19 : 165-176.
  • 9MCMILLAN L, BISHOP G. Plenoptie modeling : An image-based rendering system [A]. SlGGRAPH'95[C]. Los Angeles: [s. n. ],1995.39--46.
  • 10CIGNONIT P, MONTANIF C, DEWALL S. A fast divide and conquer Delaunay triangulation algorithm in Ed[J]. Computer-Aided Design, 1998, 30 (5):333--341.

共引文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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