郝忠孝, 王玉东, 何云斌. 空间数据库平面线段近邻查询问题研究[J]. 计算机研究与发展, 2008, 45(9): 1539-1545.
 引用本文: 郝忠孝, 王玉东, 何云斌. 空间数据库平面线段近邻查询问题研究[J]. 计算机研究与发展, 2008, 45(9): 1539-1545.
Hao Zhongxiao, Wang Yudong, He Yunbin. Line Segment Nearest Neighbor Query of Spatial Database[J]. Journal of Computer Research and Development, 2008, 45(9): 1539-1545.
 Citation: Hao Zhongxiao, Wang Yudong, He Yunbin. Line Segment Nearest Neighbor Query of Spatial Database[J]. Journal of Computer Research and Development, 2008, 45(9): 1539-1545.

## Line Segment Nearest Neighbor Query of Spatial Database

• 摘要: 空间数据库的近邻查询近几年受到人们越来越多的关注.近邻查询根据程度不同可分为点与点的近邻查询、点与线段、线段与线段的近邻查询.目前，前两者研究的较多，后者没有查到相关文献.提出平面线段与线段的近邻查询问题.有针对性地解决一些空间物体无法抽象为点的情况.平面线段的近邻查询在现实中有着广泛的应用价值.根据平面线段与线段是否相交分为两类；不相交的平面线段再根据位置关系分成9种情况.分别对上述各种情况进行讨论研究.给出了线段近邻查询的筛选规则、定理和查询算法，进行了实验分析和比较，新方法实现了平面线段与线段的近邻查询，具有较高的查询效率.

Abstract: Nearest neighbor query of spatial database has received more and more attention in recent years. According to the abstract degree, nearest neighbor query has three main categories: nearest neighbor query between point and point, nearest neighbor query between point and line segment, and nearest neighbor query between line segment and line segment. At present, the former two nearest neighbor queries. have received more research more than the last one that lacks relative literature. In this paper, the question of nearest neighbor query between line segments and line segment is put forward. It aims at solving some instance which spatial object can not be abstracted as a point. Nearest neighbor query between line segment and line segment has wide area of application in realism. According to whether two line segments are intersected, it has two categories: intersected line segment and no intersected line segment. And the position between no intersected line segments has nine categories. Every one has been studied and implemented nearest neighbor query between line segment and line segment. The filter rule, theorems and the query algorithms of the nearest neighbor query between line segment and line segment are proposed. Furthermore, the experiment analysis is also given. The method of this paper can implement the nearest neighbor query between line segment and line segment better and has high query efficiency.

/

• 分享
• 用微信扫码二维码

分享至好友和朋友圈