The paper deals with the translation of linear quadtrees, which are pointerless data structures used to represent images. A modification of Gargantini's algorithm is proposed which will make it more efficient, and new translation algorithms are proposed based on adjacency algorithms. The algorithms of this paper translate as many leaves as possible without splitting them.
Return to the "selected publications" page