智能城市2026，Vol.12Issue(1)：26-29,4.DOI:10.19301/j.cnki.zncs.2026.01.005
基于插入点法构建Delaunay三角网的室内定位优化算法
An indoor positioning optimization algorithm based on Delaunay triangulation using point insertion method
摘要
Abstract
To address the inefficiency of serial construction of Delaunay triangulations under massive data,this paper proposes a parallel optimization algorithm based on the point insertion method.By evenly dividing the point set and assigning it to multiple threads,a triangle structure containing the attributes ID,IsLock,and Isflag is designed to manage resource competition and network construction status among threads;each thread independently performs point insertion and local triangulation reconstruction,with a locking mechanism ensuring data consistency.Experiments show that for a dataset of 2 600 points,when the number of threads is 6,the parallel speedup reaches 1.69,significantly improving the construction efficiency of large-scale triangulations and making it suitable for processing large-volume indoor positioning data.关键词
室内定位/Delaunay三角网/并行计算/插入点法Key words
indoor positioning/Delaunay triangulation/parallel computing/point insertion method分类
信息技术与安全科学引用本文复制引用
李俊宝,张浩哲..基于插入点法构建Delaunay三角网的室内定位优化算法[J].智能城市,2026,12(1):26-29,4.基金项目
2026年度河南省高等学校重点科研项目(26B420002) （26B420002）
河南测绘职业学院青年科研基金项目(2023CHQN02) （2023CHQN02）
