Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve

	Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve
	Su, Tianyun; Wang, Wen; Lv, Zhihan; Wu, Wei; Li, Xinfang
刊名	COMPUTERS & GRAPHICS-UK
	2016
英文摘要	Given the enormous scale and diverse distribution of 2D point cloud data, an adaptive Hilbert curve insertion algorithm which has quasi-linear time complexity is proposed to improve the efficiency of Delaunay triangulation. First of all, a large number of conflicting elongated triangles, which have been created and deleted many times, can be reduced by adopting Hilbert curve traversing multi-grids. In addition, searching steps for point location can be reduced by adjusting Hilbert curve's opening direction in adjacent grids to avoid the "jumping" phenomenon. Lastly, the number of conflicting elongated triangles can be further decreased by adding control points during traversing grids. The experimental results show that the efficiency of Delaunaytriangulation by the adaptive Hilbert curve insertion algorithm can be improved significantly for both uniformly and non-uniformly distributed point clouddata, compared with CGAL, regular grid insertion and multi-grid insertion algorithms.
收录类别	SCI
原文出处	http://www.sciencedirect.com/science/article/pii/S0097849315001223
语种	英语
内容类型	期刊论文
源URL	[http://ir.siat.ac.cn:8080/handle/172644/10179]
专题	深圳先进技术研究院_数字所
作者单位	COMPUTERS & GRAPHICS-UK
推荐引用方式 GB/T 7714	Su, Tianyun,Wang, Wen,Lv, Zhihan,et al. Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve[J]. COMPUTERS & GRAPHICS-UK,2016.
APA	Su, Tianyun,Wang, Wen,Lv, Zhihan,Wu, Wei,&Li, Xinfang.(2016).Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve.COMPUTERS & GRAPHICS-UK.
MLA	Su, Tianyun,et al."Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve".COMPUTERS & GRAPHICS-UK (2016).