期刊文献+

三维点集的自动表面重构算法 被引量:22

Automatic Reconstruction of 3D Surface Model with 3D Irregular Points Based on Projection Constrain
下载PDF
导出
摘要 提出了一种基于透视约束利用离散三维空间点重建三维表面模型的方法,该方法充分利用摄影测量 以及激光扫描等三维测量技术中隐含的透视关系,将离散点划分到不同的投影面,在局部利用二维三角网构 网技术构建三角网,然后在考虑局部三角网边缘一致性的基础上组合成整体三维表面模型。该方法可以利用 近景摄影测量处理产生的三维景物点或激光扫描仪采集的三维空间点自动构造三维表面模型,重建物体三 维表面。实验结果表明,该算法是有效的。 Surface model reconstruction from 3D irregular points is of great importance in variable fields such as photogrammetry, 3D reconstruction based on images, scientific computing visualization, etc. 3D points can be obtained with many mature methods such as photogrammetry, laser scanning, etc. While the surface model reconstruction from 3D irregular points is still a difficult problem. In this paper, a novel algorithm based on projective constrain for automatic generation of 3D surface model is proposed. It can make full use of projective constrain of points and make surface reconstruction easy. Experiment results show its reliability.
出处 《武汉大学学报(信息科学版)》 EI CSCD 北大核心 2005年第2期154-157,共4页 Geomatics and Information Science of Wuhan University
基金 辽宁工程技术大学地理空间信息技术与应用实验室基金资助项目(2004010)
关键词 三维TIN 不规则三维离散点 透视约束 三维表面重建 D-TIN(triangulated irregular network) 3D irregular points projective constrain 3D surface reconstruction
  • 相关文献

参考文献6

二级参考文献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

共引文献86

同被引文献163

引证文献22

二级引证文献175

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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