Skip Navigation

The Computer Journal 1986 29(5):472-474; doi:10.1093/comjnl/29.5.472
© 1986 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (5)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Fabbrini, F.
Right arrow Articles by Montani, C.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Autumnal Quadtrees

F. Fabbrini * and C. Montani *

Istituto di Elaborazione dell'Infomazione, Consiglio Nazionale delle Ricerche, Via S. Maria 46, 56100 Pisa, Italy

Recently, methods have been defined and investigated for the encoding of quadtrees. Although these methods save storage space, they are normally less efficient. In this short note an artifice is suggested to encode quadtrees. It allows the preservation of the quadtree logical structure, permitting a memory saving higher than 75% without losing efficiency. The main characteristics of the new coding technique are compared with those of previous methods.

Received May 1985.

* Istituto di Elaborazione dell'Infomazione, Consiglio Nazionale delle Richerche, Via S. Maria 46, 56100 Pisa, Italy


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.