Robot Motion Planning
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Solving Disjunctive Constraints for Interactive Graphical Applications
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Identifying factors of geographic event conceptualisation
International Journal of Geographical Information Science
Detecting basic topological changes in sensor networks by local aggregation
Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems
Supporting Frameworks for the Geospatial Semantic Web
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Ontology-driven map generalization
Journal of Visual Languages and Computing
Measuring consistency with respect to topological dependency constraints
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Topological reasoning between complex regions in databases with frequent updates
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Decentralized querying of topological relations between regions without using localization
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
CLP(QS): a declarative spatial reasoning framework
COSIT'11 Proceedings of the 10th international conference on Spatial information theory
Qualitative Spatial Representation and Reasoning: An Overview
Fundamenta Informaticae - Qualitative Spatial Reasoning
Tag configuration matcher for geo-tagging
Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Hi-index | 0.00 |
Formal models of spatial relations such as the 9-Intersection model or RCC-8 have become omnipresent in the spatial information sciences and play an important role to formulate constraints in many applications of spatial data processing. A fundamental problem in such applications is to adapt geometric data to satisfy certain relational constraints while minimizing the changes that need to be made to the data. We address the problem of adjusting geometric objects to meet the spatial relations from a qualitative spatial calculus, forming a bridge between the areas of qualitative spatial representation and reasoning (QSR) and of geometric adjustment using optimization approaches. In particular, we explore how constraint-based QSR techniques can be beneficially employed to improve the optimization process. We discuss three different ways in which QSR can be utilized and then focus on its application to reduce the complexity of the optimization problem in terms of variables and equations needed. We propose two constraint-based problem simplification algorithms and evaluate them experimentally. Our results demonstrate that exploiting QSR techniques indeed leads to a significant performance improvement.