Skip to main content
SpringerLink
Log in
Book cover

Computer Architectures for Spatially Distributed Data pp 261–278Cite as

Efficient Storage of Quadtrees and Octrees

  • Conference paper

Part of the book series: NATO ASI Series ((NATO ASI F,volume 18))

Abstract

We study a method of representing space efficiently quadtrees, octrees and related pixel trees. Its efficiency of encoding two-dimensional black-and-white and multicolour images is compared to that of established methods such as chain encoding. For both two- and three-dimensional images we show that beside quad- and octrees it is relevant to consider also pixel trees based on a binary division of space. A paged storage scheme is proposed for accessing encoded pixel trees by spatial location.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. N. Ahuja and B. Schachter, Image models. Comp. Surv. 13 (1981) 4.

    Google Scholar 

  2. A. Blaser (ed.), Data base techniques for pictorial applications, Springer Verlag, Lecture Notes in Computer Science, 1980

    Google Scholar 

  3. C.C. Dyer, The space efficiency of quadtrees, Computer Graphics and Image Processing, 19(1982), 335–348

    Article  MATH  Google Scholar 

  4. H. Freeman, Computer processing of line drawing images, Comp. Surv., 6 (1974)1, 57–97

    Article  MATH  Google Scholar 

  5. I. Gargantini, An effective way to represent quadtrees. Comm. ACM 25(1982)12, 905–910

    Article  MATH  Google Scholar 

  6. R. Hunter and A.H. Robinson, International digital faximile coding standards, in 8

    Google Scholar 

  7. G.M. Hunter and G. Steiglitz, operations on images using quadtrees, IEEE PAMI-1, 1979

    Google Scholar 

  8. Special issue on digital encoding of graphics, Proc. IEEE 68(1980) 755–929

    Article  Google Scholar 

  9. J. Jimenez and J.L. Navalon, Some experiments in image vectorization, IBM J. Res. and Dev. 26(1982)6, 724–734

    Article  Google Scholar 

  10. E. Kawaguchi and T. Endo, On a method of binary-picture representation and its application to data compression. IEEE, PAMI 2(1980) 1

    Article  Google Scholar 

  11. K. Knowlton, Progressive transmission of grey scale and B/W images by simple, efficient and lossless encoding schemes. IEEE Proceedings 68 (1980), 885–896

    Article  Google Scholar 

  12. M. Kunt and O. Johnsen, Block coding of graphics: a tutorial review, in 8, 770–786

    Google Scholar 

  13. B. Mandelbrot, Fractals:, Form, Chance and Dimension, W.H. Freeman and Co, San Francisco, 1977

    MATH  Google Scholar 

  14. R.E. Miles A survey of geometrical probability in the plane, Computer Graphics and Image Processing, 12, 1980

    Google Scholar 

  15. D. Meagher, Geometric modeling using octree encoding, Computer Graphics and Image Processing, 19(1982), 129–147

    Article  Google Scholar 

  16. T.H. Morrin, II, Chain-link compression of arbitrary black-white images, Computer Graphics and Image Processing 5(1976), 172–189

    Article  Google Scholar 

  17. T. Pavlidis, Techniques for optimal compaction of pictures and maps, Computer Graphics and Image Processing 3(1974), 215–224

    Article  Google Scholar 

  18. H. Samet, Region representation: quadtrees from boundary codes, CALM 23(1980)3, 163–170

    MATH  Google Scholar 

  19. L.A. Santalo, Integral Geometry and Geometric Probability, Addison-Wesley, 1976

    MATH  Google Scholar 

  20. M. Tamminen, Performance analysis of cell based file structures, to appear in Computer Graphics and Image Processing

    Google Scholar 

  21. M. Tamminen, Efficient geometric access to a multirepresentation geo-database, submitted for publication. (Also Report-HTKK-TKOB52, Helsinki University of Technology, Espoo, 1983.)

    Google Scholar 

  22. M. Tamminen, Encoding pixel trees, submitted for publication. (Also Report-HTKK-TKO-B51, Helsinki University of Technology, Espoo, 1983.)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratory of Information Processing Science, Helsinki University of Technology, 02150, Espoo 15, Finland

    Markku Tamminen

Authors
  1. Markku Tamminen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Rutgers University, 08903, New Brunswick, NJ, USA

    Herbert Freeman (Professor of Computer Engineering) (Professor of Computer Engineering)

  2. University of Houston, 77004, Houston, TX, USA

    Goffredo G. Pieroni (Professor of Computer Science) (Professor of Computer Science)

Rights and permissions

Reprints and permissions

Copyright information

© 1985 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tamminen, M. (1985). Efficient Storage of Quadtrees and Octrees. In: Freeman, H., Pieroni, G.G. (eds) Computer Architectures for Spatially Distributed Data. NATO ASI Series, vol 18. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-82150-9_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-82150-9_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-82152-3

  • Online ISBN: 978-3-642-82150-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation