CAJ | 학술논문

单纯型连续近邻链查询在空间数据挖掘、空间数据库、数据的相似分析和推理等方面具有重要的作用。为了弥补已有方法的不足，对动态障碍物环境下的单纯型连续近邻链查询（ObSCNNC查询）问题进行了详细研究。利用Voronoi图和判定圆给出了ObSCNNC_Search算法，进一步提出了障碍物动态增加情况下的查询算法（ObSCNNC_ADD算法）和障碍物动态减少情况下的查询算法（ObSCNNC_DET算法）。对所提方法进行了实验比较与分析。理论研究与实验分析表明，所提方法较适合处理障碍物环境下的单纯型连续近邻链问题。
단순형련속근린련사순재공간수거알굴、공간수거고、수거적상사분석화추리등방면구유중요적작용。위료미보이유방법적불족，대동태장애물배경하적단순형련속근린련사순（ObSCNNC사순）문제진행료상세연구。이용Voronoi도화판정원급출료ObSCNNC_Search산법，진일보제출료장애물동태증가정황하적사순산법（ObSCNNC_ADD산법）화장애물동태감소정황하적사순산법（ObSCNNC_DET산법）。대소제방법진행료실험비교여분석。이론연구여실험분석표명，소제방법교괄합처리장애물배경하적단순형련속근린련문제。
The Simple Continues Near Neighbor Chain Query(SCNNC-Query)has important significance in the spatial data mining, spatial database, similarity analysis and reasoning of data etc. To remedy the deficiency of the existing work, the Simple Continues Near Neighbor Chain Query with dynamic Obstacles(ObSCNNC-Query)is studied. Based on the Voronoi diagram and judging circle, the ObSCNNC_Search algorithm, the ObSCNNC_ADD algorithm and the ObSCNNC_DET algorithm are given. Furthermore, the performance of the methods is analyzed and compared by experi-ment. The theatrical study and the experimental results show that the algorithms have great advantages.