Howe, Jacob M. and King, Andy and Lawrence-Jones, Charles (2010) Quadtrees as an Abstract Domain. Electronic Notes in Theoretical Computer Science, 267 (1). pp. 182-196. (doi:https://doi.org/10.1016/j.entcs.2010.09.008) (Full text available)
Quadtrees have proved popular in computer graphics and spatial databases as a way of representing regions in two dimensional space. This hierarchical data-structure is flexible enough to support non-convex and even disconnected regions, therefore it is natural to ask whether this data-structure can form the basis of an abstract domain. This paper explores this question and suggests that quadtrees offer a new approach to weakly relation domains whilst their hierarchical structure naturally lends itself to representation with boolean functions.
|Subjects:||Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,|
|Divisions:||Faculties > Sciences > School of Computing > Programming Languages and Systems Group|
|Depositing User:||Andy King|
|Date Deposited:||21 Sep 2012 09:49 UTC|
|Last Modified:||16 Dec 2013 12:44 UTC|
|Resource URI:||https://kar.kent.ac.uk/id/eprint/30620 (The current URI for this page, for reference purposes)|