Skip navigation

Relations between adjacency trees

Relations between adjacency trees

Stell, John and Worboys, Michael (2011) Relations between adjacency trees. Theoretical Computer Science, 412 (34). pp. 4452-4468. ISSN 0304-3975 (doi:

Full text not available from this repository. (Request a copy)


Adjacency trees can model the nesting structure of spatial regions. In many applications it is necessary to model foreground and background regions which exhibit changes over
time such as splitting, where one region divides into two. For example, the qualitative description of the development of wildfires would use the foreground for areas on fire
and the background for areas not on fire. Such dynamic behaviour can be modelled by a particular kind of relation between the nodes of two adjacency trees representing the initial and final configurations of the regions at two times. These relations, which we call bipartite,
correspond to having an arbitrary relation between the foreground regions at the two times and an arbitrary relation between the background regions at the two times. We show that all bipartite relations between trees arise from sequences of atomic relations between trees. There are just four types of these atomic relations (in addition to one representing no change): inserts, splits, merges and deletes. © 2011 Elsevier B.V.

Item Type: Article
Additional Information: [1] First published: 5 August 2011. [2] Published as: Theoretical Computer Science, (2011), Vol. 412, (34), pp. 4452–4468.
Uncontrolled Keywords: adjacency trees, relations, spatial reasoning, qualitative spatial change
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty / Department / Research Group: Faculty of Liberal Arts & Sciences
Faculty of Liberal Arts & Sciences > School of Computing & Mathematical Sciences (CAM)
Related URLs:
Last Modified: 26 Nov 2020 22:35
Selected for GREAT 2016: None
Selected for GREAT 2017: None
Selected for GREAT 2018: None
Selected for GREAT 2019: None
Selected for REF2021: None

Actions (login required)

View Item View Item