ACM Home Page
Please provide us with feedback. Feedback
Dimension-refined topological predicates
Full text PdfPdf (213 KB)
Source Geographic Information Systems archive
Proceedings of the 13th annual ACM international workshop on Geographic information systems table of contents
Bremen, Germany
SESSION: Data modeling - performance evaluation table of contents
Pages: 240 - 249  
Year of Publication: 2005
ISBN:1-59593-146-5
Authors
Mark McKenney  University of Florida, Gainesville, FL
Alejandro Pauly  University of Florida, Gainesville, FL
Reasey Praing  University of Florida, Gainesville, FL
Markus Schneider  University of Florida, Gainesville, FL
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 25,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1097064.1097098
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
 
5
M. J. Egenhofer and J. Herring. Categorizing Binary Topological Relations Between Regions, Lines, and Points in Geographic Databases. Technical Report 90-12, National Center for Geographic Information and Analysis, University of California, Santa Barbara, 1990.
 
6
M. Schneider. Spatial Data Types for Database Systems - Finite Resolution Geometry for Geographic Information Systems, volume LNCS 1288. Springer-Verlag, Berlin Heidelberg, 1997.
 
7
M. Schneider and T. Behr. Topological Relationships between Complex Spatial Objects. Technical Report 011, University of Florida, Department of Computer & Information Science & Engineering, 2004.
 
8
R. B. Tilove. Set Membership Classification: A Unified Approach to Geometric Intersection Problems. IEEE Trans. on Computers, C-29:874--883, 1980.
 
9
E. W. Weisstein, editor. CRC Concise Encyclopedia of Mathematics. Chapman & Hall/CRC, Boca Raton, 2nd edition, 2003.


Collaborative Colleagues:
Mark McKenney: colleagues
Alejandro Pauly: colleagues
Reasey Praing: colleagues
Markus Schneider: colleagues