期刊
KNOWLEDGE-BASED SYSTEMS
卷 22, 期 6, 页码 403-409出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.knosys.2009.05.004
关键词
Spatial reasoning; Constraint satisfaction problem; R-tree; Hash index
资金
- SUST Spring Bud
The problem of spatial configuration information retrieval is a constraint satisfaction problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data can be reorganized using index techniques like R-tree and the spatial data are approximated by their minimum bounding rectangles (MBRs), so the spatial configuration information retrieval is actually based on the MBRs and some special techniques can be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Three algorithms are designed and studied, and their performances are compared. (C) 2009 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据