A Triangulation Algorithm Based on Edge-pointer Search and Region-division

被引：0
|
作者：
Zhang J. [1 ]
Tian H.-M. [2 ]
机构：
[1] School of Automation, Central South University, Changsha
[2] School of Computer Science and Engineering, Central South University, Changsha
来源：
Zidonghua Xuebao/Acta Automatica Sinica | 2021年 / 47卷 / 01期
基金：
中国国家自然科学基金;
关键词：
3D reconstruction; Delaunay triangulation; Edge-pointer; Region-division;
D O I：
10.16383/j.aas.c190155
中图分类号：
学科分类号：
摘要：
To solve the problem of taking too much time when dealing with large-scale data, a triangulation algorithm based on edge-pointer search and region-division is proposed. A data structure based on the edge-pointer is designed to reflect the positional relationship between triangles, and the search path of the target triangle is also optimized. Moreover, region-division is utilized to reduce the search depth. The square which contains the super triangle is divided into some regions of the equal size. The search for the target triangle begins with the entry triangle of the region where the insertion point is located. As a result, the search scope of the target triangle is narrowed. Experiment results show that the algorithm is much more efficient than the traditional Delaunay triangulation algorithm. Copyright © 2021 Acta Automatica Sinica. All rights reserved.
引用
收藏
页码：100 / 107
页数：7
相关论文
共 27 条
  • [1] Chen Jia, Zhang Yu-Qi, Song Peng, Wei Yan-Tao, Wang Yu, Application of deep learning to 3D object reconstruction from a single image, Acta Automatica Sinica, 45, 4, pp. 657-668, (2019)
  • [2] Xue Jun-Shi, Yi Hui, Wu Zhi-Huan, Chen Xiang-Ning, A hybrid multi-View 3D reconstruction method based on scene graph partition, Acta Automatica Sinica, 46, 4, pp. 782-795, (2020)
  • [3] Liu Jian, Bai Di, 3D point cloud registration algorithm based on feature matching, Acta Optica Sinica, 38, 12, pp. 240-247, (2018)
  • [4] Liu Hai-Qiang, Yu Jian-Bo, A bidimensional local mean de- composition algorithm, Journal of Computer-Aided Design & Computer Graphics, 30, 10, pp. 1859-1869, (2018)
  • [5] Yan Zi-Geng, Jiang Jian-Guo, Guo Dan, Image matching based on SURF feature and Delaunay triangular meshes, Acta Automatica Sinica, 40, 6, pp. 1216-1222, (2014)
  • [6] Liu Qin-Qin, Overview of point location algorithm of Delaunay triangulation on plane domain, Electronic Design Engineering, 25, 1, pp. 47-51, (2017)
  • [7] Lin J, Chen R, Yang C, Shu Z, Wang C, Lin Y, Et al., Distributed and parallel Delaunay triangulation construction with balanced binary-tree model in cloud, Proceedings of 15th International Symposium on Parallel and Distributed Computing, pp. 107-113, (2017)
  • [8] Lin J, Chen R, Wu L, Shu Z, Yang C., Adaptive parallel Delaunay triangulation construction with dynamic pruned binary tree model in Cloud, Concurrency & Computation Practice & Experience, 29, 8, (2017)
  • [9] Bowyer A., Computing Dirichlet tessellations, The Computer Journal, 24, 2, pp. 162-166, (1981)
  • [10] Watson D F., Computing the N-Dimensional Delaunay tessellation with application to Voronoi polytopes, The Computer Journal, 24, 2, pp. 167-172, (1981)
123