Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (32): 155-157.DOI: 10.3778/j.issn.1002-8331.2008.32.046

• 图形、图像、模式识别 • Previous Articles     Next Articles

Research of branching problem algorithm in 3D object surface reconstruction

CHEN Xue-gong1,LI Xiao-yong1,ZENG Jun-gang1,XIAO Ke-yan2   

  1. 1.School of Information Science and Engineering,Central South University,Changsha 410083,China
    2.Institute of Resources,Academic of Geological Science of China,Beijing 100037,China
  • Received:2007-12-11 Revised:2008-02-27 Online:2008-11-11 Published:2008-11-11
  • Contact: CHEN Xue-gong

三维物体表面重建的分支处理算法研究

陈学工1,李小勇1,曾俊钢1,肖克炎2   

  1. 1.中南大学 信息科学与工程学院,长沙 410083
    2.中国地质科学院 矿产资源研究所,北京 100037
  • 通讯作者: 陈学工

Abstract: The paper applies Delaunay triangulation to branching problem according to characteristics of the Delaunay triangulation of constrained edge point sets,moreover,mends and implements a branching problem algorithm.This algorithm projects the neighboring section contours onto a same section which creates a constrained edge point set.Then Delaunay triangulation is applied to them,new contours are created according to the result of triangulation,and forms one-to-one relation of the contours.Experiment result indicates that the algorithm accords with fact well,and can deal with a variety of situations.

Key words: 3D-object reconstruction, branching problem, Delaunay triangulation

摘要: 根据平面点集Delaunay三角剖分的特性,将Delaunay三角剖分应用到分支问题上,改进和实现了一种分支问题处理算法。将相邻层轮廓线投影到同一个剖面上形成一个带约束边的平面点集,并将它们Delaunay三角化,根据这些三角形组来生成新的轮廓线,使轮廓线一一对应。实验结果表明该算法实现的效果较符合实际情况,能有效地处理各种不同情况。

关键词: 三维表面重建, 分支问题, Delaunay三角剖分