多轮廓线的三维形体重构技术研究与实现

J4 ›› 2015, Vol. 37 ›› Issue (01): 133-138.

多轮廓线的三维形体重构技术研究与实现

刘坤良1，黄金明2

（1.天津工业大学计算机科学与软件学院，天津 300387;2.中国地质调查局发展研究中心，北京 100037)

收稿日期:2013-04-10 修回日期:2013-07-04 出版日期:2015-01-25 发布日期:2015-01-25
基金资助:
中国地质调查局发展研究中心承担的“华南地区深部岩体圈定与形态研究”工作项目（［2011］022214）

Study and implementation of multi-contour 3D reconstruction

LIU Kunliang1，HUANG Jinming2

(1.School of Computer Science & Software Engineering,Tianjin Polytechnic University,Tianjin 300387;
2.Development and Research Center,China Geological Survey,Beijing 100037,China)

Received:2013-04-10 Revised:2013-07-04 Online:2015-01-25 Published:2015-01-25

摘要/Abstract

摘要：

实际应用中，三维重构经常面对的不是直接的体数据信息，而是一序列的二维轮廓线数据，因此基于轮廓线的三维重构研究有着极其重要的实用价值。在多轮廓线的三维形体重构中，轮廓对应、轮廓拼接、分叉处理和末端轮廓线的封闭处理等是其关键技术。提出了三维重构中每一个实现步骤具体的解决方案。针对轮廓线绕向问题提出了夹角和检测法，有效避免了轮廓多边形的绕向误判；对轮廓线一对多分叉问题提出了按周长比率解决问题的思路；在末端轮廓线的三角剖分算法中提出了最大张角三角形方法，减少了三角剖分的计算量，达到了在各种形态轮廓线条件下能够实现正确的拼接。实现结果表明，轮廓线拼接过程中每个步骤的解决方法是正确有效的，相较于其他实现方法通用性更强。

关键词: 轮廓线, 三维重构, Delaunay三角剖分, 凸包

Abstract:

In practical applications, 3D reconstruction often faces a series of 2D contour lines rather than the volume data we often process, so studying 3D reconstruction based on contours has important practical values. The key technologies of 3Dreconstruction based on multiple contours include contours corresponding, contours splicing, crotched contours handling, and terminal contours closing . The concrete solutions to each step of 3D construction of contours are given. According to the winding direction issue of contours, we propose a method of gauging the sum of angles, avoiding error judgment of the winding direction of contours. For the crotching issue of one contour corresponding to multiple contours, we give a way of splitting contours based on the circumference ratio of corresponding contours. We also give the means of maximum angle in order to reduce the calculation time on triangulating terminal contours. The proposed solutions can achieve correct contours splicing of any contours, guarantee that each step of the solution is correct and effective, and they are more universal compared to other solutions.

Key words: contour;3D reconstruction;Delaunay triangulate;convex hull

刘坤良1，黄金明2. 多轮廓线的三维形体重构技术研究与实现[J]. J4, 2015, 37(01): 133-138.

LIU Kunliang1，HUANG Jinming2. Study and implementation of multi-contour 3D reconstruction [J]. J4, 2015, 37(01): 133-138.

参考文献

［1］Huang Yongli. Theory and technology research of 3D reconstruction based on sliceimages data［D］. Zhengzhou:Zhengzhou University, 2004.(in Chinese)
［2］Li Yunfeng,Liu Xiuguo．Algorithm of contours splicing based on OBB projection transformation ［J］． Journal of Computer Applications， 2011,31(12):33533356．(in Chinese)
［3］Mao Xiancheng, Lu Xiaoqin, Xu Zhiqiang．Triangle tiles reconstruction from drill databased complex contours［J］．Computer Engineering and Applications，2009,45(23):179181．(in Chinese)
［4］Ma Hongbin, Guo Jiateng. Cutandsew algorithm:A new multicontour reconstruction algorithm［J］．Journal of Northeastern University,2007, 28(1):111114．(in Chinese)
［5］Wu Zhonghai,Ye Chengqing,Pan Yunhe．An Improved algorithm of convex hull computing［J］．Journal of ComputerAided Design & Computer Graphics，1997,9(1):913．(in Chinese)
［6］Tang Zhesheng. Visualization of 3d spatial data sets［M］. Beijing:Tsinghua University Press,1992.(in Chinese)
［7］Tu Zhihong, Sang Nong．Delaunay triangulation algorithm of arbitrary polygons with visual C language［J］．Computer & Digital Engineering，2005，33(1):3436．(in Chinese)
［8］Li Mei， Mao Shanjun， Ma Ainai． Building orebody solid model from planar contours［J］．Journal of ComputerAided Design & Computer Graphics，2006，18(7):10171021．(in Chinese)
［9］Shu An，Ran Shuyang，Wu Zhangwen，et al． Three dimensional surfaces reconstruction based on shape of adjacent layer contours［J］．Journal of Computer Applictions，2009，29(2):450452．(in Chinese)
［10］Seung Won Shin, Damir Juric. Modeling threedimensional multiphase flow using a level contour reconstruction method for front tracking without connectivity［J］. Journal of Computational Physics, 2002,180:427470.
附中文参考文献：
［1］黄永丽. 基于断层数据的三维重建理论与技术的研究［D］.郑州：郑州大学, 2004.
［2］李运峰，刘修国．基于方向包围盒投影转换的轮廓线拼接算法［J］．计算机应用， 2011,31(12):33533356．
［3］毛先成，卢晓琴，徐志强．基于钻孔数据的复杂轮廓线三角面片的重构［J］．计算机工程与应用，2009,45(23):179181．
［4］马洪滨，郭甲腾．一种新的多轮廓线重构三维形体算法：切开缝合法［J］．东北大学学报（自然科学版）, 2007, 28(1):111114．
［5］吴中海，叶澄清，潘云鹤．一个改进的简单多边形凸包算法［J］．计算机辅助设计与图形学学报，1997,9(1):913．
［6］唐泽圣. 三维数据场可视化［M］. 北京:清华大学出版社,1992.
［7］涂治红，桑农．用VC语言实现任意多边形的Delaunay完全三角剖分［J］．计算机与数字工程，2005，33(1):3436．
［8］李梅，毛善君，马蔼乃．平行轮廓线三维矿体重建算法［J］．计算机辅助设计与图形学学报，2006，18(7):1017 1021．
［9］苏安，冉蜀阳，吴章文，等．基于相邻层轮廓线几何形状匹配的三维重建［J］．计算机应用，2009，29(2):450452．

[1]	邢彩燕，张志毅，胡少军，耿楠. 基于图像尖锐度的角点匹配算法[J]. 计算机工程与科学, 2019, 41(04): 665-672.
[2]	杨军，林岩龙，李龙杰，王小鹏. 基于快速Delaunay三角化的散乱点曲面重建算法[J]. J4, 2015, 37(06): 1189-1195.
[3]	张志毅，吕之华. 基于物理的波浪实时模拟方法[J]. J4, 2014, 36(03): 508-512.
[4]	李志,李儒琼. 一种改进的快速三维凸包生成算法及实现[J]. J4, 2011, 33(2): 129-132.
[5]	李超, 彭力, 赵龙. 基于图论的无线传感器网络自组织性能研究[J]. J4, 2010, 32(1): 25-28.
[6]	李铭卢锡城彭伟. 传感网中的动态Delauanay三角剖分算法[J]. J4, 2006, 28(9): 88-90.
[7]	刘新刘任任. 一种改进的构建凸包的分治算法[J]. J4, 2006, 28(8): 63-65.
[8]	徐牧王润生. 一种组合主动轮廓线模型算法[J]. J4, 2004, 26(12): 38-41.
[9]	雷明涛达飞鹏谭小洪郑君立. 杂乱点云的快速曲线拟合算法研究[J]. J4, 2004, 26(1): 31-33.
[10]	魏迎梅[1] 吴泉源[2] 等. 虚拟环境中的碰撞检测方法[J]. J4, 2001, 23(2): 44-47.