期刊文献+

基于VTK的室外场景三维重建 被引量:6

3D Reconstruction of Outdoor Scenes Based on Visualization Toolkit
下载PDF
导出
摘要 采用VC++6.0作为开发平台,引入三维可视化类库VTK,实现了激光扫描数据的几何建模。通过数据压缩、平面分割减少数据量,并分别采用Delaunay三角化、轮廓线和MarchingCubes等不同的建模方法,重建室外真实三维场景。 3D Visualization Toolkit was employed using VC++6.0 to create 3D geometric model from laser data. Firstly, data was reduced through plane segmentation. And then, different modeling methods were used to reconstruct 3D outdoor scenes, such as Delaunay 3D、Contour、Marching Cubes.
出处 《系统仿真学报》 CAS CSCD 北大核心 2006年第z2期411-413,417,共4页 Journal of System Simulation
基金 国家科技部十五科技攻关项目(2004BA810B) 北京市属市管高等学校"学术创新团队计划"项目 北京市教委科技发展计划项目(KM200610028012)。
关键词 可视化类库VTK 三维重建 三角化 轮廓线 MarchingCubes visualization toolkit 3D reconstruction triangulation contour MarchingCubes
  • 相关文献

参考文献6

  • 1[1]P K Allen,A Troccoli,B Smith,S Murray,I Stamos,M Leordeanu.New methods for digital modeling of historic sites[J].IEEE Comp Graph and Applic (S0272-1716),2003,23(6):32-41.
  • 2[2]Besl PJ,Mckay N D.A method for registration of 3-D shapes[J].IEEE Transactions on Pattern Analysis and Machine Intelligence (S0162-8828),1992,14(2):239-256.
  • 3[3]Yokoya N,Levine M D.Range image segmentation based on differential geometry:A hybrid approach[J].IEEE Transactions on Pattern Analysis and Machine Intelligence (S0162-8828),1989,11(6):643 -649.
  • 4[4]J Hu,S You,U Neumann.Approaches to Large-Scale Urban Modeling[J].IEEE Computer Graphics and Applications (S0272-1716),2003,23(6):62-69.
  • 5[5]P Allen,I Stamos,A Troccoli,etc.3D Modeling of Historic Sites Using Range and Image Data[J].IEEE Int.Conf.on Robotics &Automation (S1050-4729),2003.1(1):145-150.
  • 6梁荣华,陈纯,潘志庚,张慧.一种面向三维点集的快速表面重构算法[J].中国图象图形学报,2003,9(1):66-70. 被引量:12

二级参考文献15

  • 1崔汉国,胡瑞安,金端峰,杨叔子.三维任意区域中点集的三角剖分算法[J].计算机辅助设计与图形学学报,1995,7(2):103-108. 被引量:12
  • 2J.R.Shewchuk.A Condition Guaranteeing the Existence of Higher-Dimensional Constrained Delaunay Triangulations. Proceedings of the Fourteenth Annual Symposium on Computational Geometry . 1998
  • 3Joe B.Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation. International Journal for Numerical Methods in Engineering . 1991
  • 4William E Lorensen,Harvey E Cline.Marching cubes: A high resolution 3D surface construction algorithm. ACM SIGGRAPH Course Notes . 1987
  • 5Hugues Hoppe.Surface reconstruction from unorganized points. . 1994
  • 6Hoppe H,DeRose T,Duchamp T,McDonald J et al.Surface reconstruction from unorganized points. Computer Graphics(SIGGRAPH’ 92 Proceedings) . 1992
  • 7Barber C B,Dobkin D P,Huhdanpaa H T.The quickhull algorithm for convex hulls. ACM Transactions on Mathematical Software . 1996
  • 8Shewchuk J R.Sweep algorithms for constructing higherdimensional constrained Delaunay triangulations. In:Proceedings of the Sixteenth Annual Symposium on Computational Geometry[C], Hong Kong . 2000
  • 9Joe B.Delaunay triangular meshes in convex polygons. SIAM Journal on Scientific and Statistical Computing . 1986
  • 10Joe B.Three-dimensional triangulations from local transformations. SIAM Journal on Scientific and Statistical Computing . 1989

共引文献11

同被引文献45

引证文献6

二级引证文献14

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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