Dimension-refined topological predicates

Authors:
Mark McKenney;Alejandro Pauly;Reasey Praing;Markus Schneider
Affiliations:
University of Florida, Gainesville, FL;University of Florida, Gainesville, FL;University of Florida, Gainesville, FL;University of Florida, Gainesville, FL
Venue:
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Year:
2005

Citing 4
Cited 3

A comparison of methods for representing topological relationships

Information Sciences—Applications: An International Journal
A model for representing topological relationships between complex geometric features in spatial databases

Information Sciences: an International Journal
A Small Set of Formal Topological Relationships Suitable for End-User Interaction

SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
Qualitative and Topological Relationships in Spatial Databases

SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases

Efficient Implementation Techniques for Topological Predicates on Complex Spatial Objects

Geoinformatica
The neighborhood configuration model: a framework to distinguish topological relationships between complex volumes

ER'11 Proceedings of the 30th international conference on Advances in conceptual modeling: recent developments and new directions
Multidimensional mereotopology with betweenness

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two

Quantified Score

Hi-index	0.01

Visualization

Abstract

Topological predicates, as derived from the 9-intersection model, have been widely recognized in GIS, spatial database systems, and many other geo-related disciplines. They are based on the evaluation of nine Boolean predicates checking the intersections of the boundary, interior, and exterior of a spatial object with the respective parts of another spatial object for inequality to the empty set. In this paper, we replace each Boolean predicate, which is a topological invariant, by another topological invariant. This new invariant is given as a function yielding the dimension of the respective intersection in the 9-intersection matrix, resulting in a dimension matrix. The goal of this paper is to determine the definition and semantics of all predicates that can be derived from this matrix for all combinations of spatial data types. It turns out that these dimension-based predicates are special refinements of the aforementioned topological predicates; hence, we call them dimension-refined topological predicates. We show that these predicates allow us to pose a class of more fine-grained topological queries.