Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definitely been on the design of and reasoning with these predicates, whereas implementation issues have been largely neglected. Besides, design efforts have been restricted to simplified abstractions of spatial objects like single points, continuous lines, and simple regions. In this paper, we present a general algorithm which is based on the well known plane-sweep paradigm and determines the topological relationship between two given complex regions. © Springer-Verlag Berlin Heidelberg 2004.
CITATION STYLE
Schneider, M. (2004). Computing the topological relationship of complex regions. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3180, 844–853. https://doi.org/10.1007/978-3-540-30075-5_81
Mendeley helps you to discover research relevant for your work.