Issue No. 06 - June (2006 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.102
Current spatial database systems offer limited querying capabilities beyond binary topological relations. This paper introduces a model for projective relations between regions to support other qualitative spatial queries. The relations are ternary because they are based on the collinearity invariant of three points under projective geometry. The model is built on a partition of the plane into separate zones that are obtained from projective properties of two reference objects: Then, by considering the empty/nonempty intersections of a primary object with these zones, the model is able to distinguish between 34 different projective relations. Then, the paper proposes original algorithms for computing the relations under the assumption that regions of the plane are stored as vector polygons in a spatial database. These algorithms run in optimal O(n \log n) time.
Spatial databases, spatial queries, projective relations, geographic information systems.
R. Billen and E. Clementini, "Modeling and Computing Ternary Projective Relations between Regions," in IEEE Transactions on Knowledge & Data Engineering, vol. 18, no. , pp. 799-814, 2006.