A Cutting Block Algorithm for Constructing Delaunay Triangulation Based on Streaming Computation

被引：0
|
作者：
Zhang C. [1 ,2 ]
Zhao X. [1 ]
Wang H. [3 ]
机构：
[1] Mining College, Guizhou University, Guiyang
[2] College of Geoscience & Surveying Engineering, China University of Mining & Technology (Beijing), Beijing
[3] Beijing Research Institute of Uranium Geology, Beijing
来源：
Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University | 2017年 / 42卷 / 07期
关键词：
Cutting block; Decoupled domain decomposition mode; Delaunay triangulation; Streaming computation; Time and space performance;
D O I：
10.13203/j.whugis20150375
中图分类号：
学科分类号：
摘要：
In order to solve the difficulty that the existing algorithms can't give attention to both the capability of time and space when constructing Delaunay triangulation with massive LiDAR points cloud, a cutting block Delaunay triangulation algorithm using streaming computation is presented. DeWall (Delaunay wall) is constructed firstly to cut an independent point cloud data block with specific size and shape, which is suitable for the divide-and-conquer algorithm and can avoid deep recursion and memory overflow. Then the cutting block is triangulated with a divide-and-conquer algorithm, and an algorithm is proposed to delete the wrong triangles on the boundary of the cutting block triangulation. The process described above is repeated to construct all the sub-triangulations, which can be merged directly according to the property of the decoupled domain decomposition mode finally. Meanwhile, the streaming computation is introduced so that the algorithm has a more excellent capability of space. The analysis and experiments show that the algorithm has a low memory footprint and is efficient with a time complexity close to O(nlg(δ))(δ is the number of points in a cutting block and δ≤n). © 2017, Research and Development Office of Wuhan University. All right reserved.
引用
收藏
页码：931 / 936
页数：5
相关论文
共 15 条
  • [1] Li J., Li D., Shao Z., A Streaming Data Delaunay Triangulation Algorithm Based on Parallel Computing, Geomatics and Information Science of Wuhan University, 38, 7, pp. 794-798, (2013)
  • [2] Wu X., Wang S., Xiao C., A New Study of Delaunay Triangulation Creation, Acta Geodaetica et Cartographica Sinica, 28, 1, pp. 28-35, (1999)
  • [3] Wu X., Wang S., Xiao C., A Hybridized Method for Building Delaunay Triangulation, Journal of Remote Sensing, 4, 1, pp. 32-35, (2000)
  • [4] Wu Y., Zhang D., Improved Algorithm for Building Delaunay Triangulation, Journal of Zhejiang University (Science Edition), 31, 3, pp. 343-348, (2004)
  • [5] Rui Y., Wang J., A New Study of Compound Algorithm Based on Sweep Line and Divide-and-conquer Algorithm for Constructing Delaunay Triangulation, Acta Geodaetica et Cartographica Sinica, 36, 3, pp. 358-362, (2007)
  • [6] Hu J., Pan M., Ma Z., Et al., Study on Faster Algorithm for Constructing Delaunay Triangulations DTM, Acta Scientiarum Naturalium Universitatis Pekinensis, 39, 5, pp. 736-741, (2003)
  • [7] Hu J., Ma Z., Wu H., Et al., Massive Data Delaunay Triangulation Base on Grid Partition Method, Acta Geodaetica et Cartographica Sinica, 33, 2, pp. 163-167, (2004)
  • [8] Dong J., Peng R., Zheng Y., An Improved Algorithm of Point-by-point Interpolation by Using Local Dynamic Optimal Delaunay Triangulation Network, Geomatics and Information Science of Wuhan University, 38, 5, pp. 613-617, (2013)
  • [9] Shen J., Liu J., Lin X., Et al., A Method for Delaunay Triangulation by Integration of Distance Transformation and Region Adjacency Grapuics, Geomatics and Information Science of Wuhan University, 37, 8, pp. 1000-1003, (2012)
  • [10] Zalik B., An Efficient Sweep-line Delaunay Triangulation Algorithm, Computer-Aided Design, 37, 10, pp. 1027-1038, (2005)
12