期刊文献+

可视化类库VTK在三维建模中的应用 被引量:10

The Application of 3D Visualization Toolkit in 3D Reconstruction
在线阅读 下载PDF
导出
摘要 采用VC++6.0作为开发平台,引入三维可视化类库VTK,实现了散乱数据和体数据的建模.通过数据压缩、平面分割来减少数据量,分别采用不同的建模方法,如Delaunay三角化建模、轮廓线建模、MarchingCubes建模,实现了三维数据的建模. This paper uses VC ++ 6. 0 as exploitation environment, imports 3D Visualization Toolkit, realizes the reconstruction of unorganized-points and volume-data. Through data compression and plane segmentation to reduce data, separately adopts different modeling means, for example Delaunay 3D, Contour, Marching Cubes, implements the reconstruction of 3D data.
出处 《首都师范大学学报(自然科学版)》 2007年第1期73-76,82,共5页 Journal of Capital Normal University:Natural Science Edition
关键词 可视化类库VTK 三维重建 散乱数据 三角化 轮廓线 MARCHING CUBES Visualization Toolkit, 3D reconstruction, unorganized points, triangulation, Contour, Marching Cubes
  • 相关文献

参考文献7

  • 1P.K.Allen,A.Troccoli,B.Smith,S.Murray,I.Stamos,and M.Leordeanu.New methods for digital modeling of historic sites[J].IEEE Comp.Graph.And Applic.,23(6):32 41,2003.
  • 2Besl PJ,Mckay N D.A method for registration of 3 D shapes[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1992,14(2):239 256.
  • 3Yokoya N,Levine M D.Range image segmentation based on differential geometry:A hybrid approach[J].IEEE Transactions on Pattern Analysis and Machine Intelligence,1989,11(6):643-649.
  • 4J.Hu,S.You,and U.Neumann,"Approaches to Large-Scale Urban Modeling"[J],IEEE Computer Graphics and Applications,Volume 23,Issue 6,2003,pp.62-69.
  • 5P.Allen I.Stamos,A.Troccoli,etc.,"3D Modeling of Historic Sites Using Range and Image Data"[J],IEEE Int.Conf.On Robotics & Automation,2003,pp.145 150.
  • 6王青,王融清,鲍虎军,彭群生.散乱数据点的增量快速曲面重建算法[J].软件学报,2000,11(9):1221-1227. 被引量:71
  • 7梁荣华,陈纯,潘志庚,张慧.一种面向三维点集的快速表面重构算法[J].中国图象图形学报,2003,9(1):66-70. 被引量:12

二级参考文献16

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

共引文献78

同被引文献76

引证文献10

二级引证文献23

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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