Research of branching problem algorithm in 3D object surface reconstruction

doi:10.3778/j.issn.1002-8331.2008.32.046

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-gong¹,LI Xiao-yong¹,ZENG Jun-gang¹,XIAO Ke-yan²

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.中南大学信息科学与工程学院，长沙 410083
2.中国地质科学院矿产资源研究所，北京 100037

通讯作者: 陈学工

Abstract

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三角剖分

CHEN Xue-gong¹,LI Xiao-yong¹,ZENG Jun-gang¹,XIAO Ke-yan². Research of branching problem algorithm in 3D object surface reconstruction[J]. Computer Engineering and Applications, 2008, 44(32): 155-157.

陈学工¹,李小勇¹,曾俊钢¹,肖克炎². 三维物体表面重建的分支处理算法研究[J]. 计算机工程与应用, 2008, 44(32): 155-157.

[1]	LUO Dai, TAO Yang, YANG Gang. Face texture mapping and deformation with constrains of facial feature [J]. Computer Engineering and Applications, 2018, 54(6): 188-192.
[2]	LI Zhengxin, LIU Jianli, ZHOU Jian, GAO Weidong. Improvements of fabric defect segmentation based on bidimensional empirical mode decomposition [J]. Computer Engineering and Applications, 2016, 52(24): 217-222.
[3]	DANG Xiaochao1，2, LI Fenfang1, HAO Zhanjun1，2. Method of node’s fuzzy information localization about Delaunay triangulation in three-dimensional space [J]. Computer Engineering and Applications, 2016, 52(23): 115-122.
[4]	ZHU Qingsheng, TANG Hui, FENG Ji. Outlier detection algorithm based on Delaunay triangulation [J]. Computer Engineering and Applications, 2015, 51(16): 166-170.
[5]	ZHOU Xuemei1, LI Yingfei2. Algorithm research to generate triangulation network based on Bowyer-Watson [J]. Computer Engineering and Applications, 2013, 49(6): 198-200.
[6]	LONG Mansheng1，XU Hongzhi1，ZHANG Daokun2，CHEN Tongju1. Building digital elevation model with eroded microtopography from point cloud [J]. Computer Engineering and Applications, 2011, 47(36): 193-196.
[7]	SUN Lisheng，ZHENG Jianjing，CHEN Jianjun，DAI Meihuang，LIANG Yi. Two-dimensional adaptive advancing front mesh generation [J]. Computer Engineering and Applications, 2011, 47(3): 146-148.
[8]	XU Peng-fei^1，2，CHEN Zhi-gang². Improved incremental construction algorithm of Voronoi region [J]. Computer Engineering and Applications, 2010, 46(8): 8-10.
[9]	SUN Ji-zhong¹，MA Yong-qiang¹，HU Yan²，KONG Xu¹. Barrier coverage based on distributed Delaunay triangulation [J]. Computer Engineering and Applications, 2010, 46(26): 76-79.
[10]	QIU Bao-zhi，JU Chang-tao. Study of boundary detecting technique with clustering [J]. Computer Engineering and Applications, 2010, 46(20): 133-137.
[11]	LI Hai-sheng¹，CAI Qiang¹，LIU Yue-wu². Research on generating streamlines in seepage flow field [J]. Computer Engineering and Applications, 2010, 46(18): 233-236.
[12]	ZHONG Jia-min，GUO Xin-zhi，LI Yuan. Precise clipping algorithm for 3D triangulated irregular network [J]. Computer Engineering and Applications, 2010, 46(16): 204-206.
[13]	CHEN Xue-gong¹，LI Yuan¹，CAO Jian¹，XIAO Ke-yan² . Improved algorithm of inserting constrained edge into Delaunay triangulation [J]. Computer Engineering and Applications, 2009, 45(24): 235-237.
[14]	WANG Yong-hui,LI Yu-mei,SONG Xiao-yu. Study on higher order Delaunay triangulation and generation algorithm [J]. Computer Engineering and Applications, 2008, 44(27): 72-74.
[15]	WANG Zhan-gang,PAN Mao,QU Hong-gang,WANG Bin. Algorithm of Delaunay triangulation of 3D folded cross-section [J]. Computer Engineering and Applications, 2008, 44(1): 94-96.

Research of branching problem algorithm in 3D object surface reconstruction

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

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics