Data Structures for Quadtree Approximation and Compression

@article{Samet1985DataSF,
  title={Data Structures for Quadtree Approximation and Compression},
  author={Hanan Samet},
  journal={Commun. ACM},
  year={1985},
  volume={28},
  pages={973-993}
}
A number of data structures for representing images by quadtrees without pointers are discussed. The image is treated as a collection of leaf nodes. Each leaf node is represented by use of a locational code corresponding to a sequence of directional codes that locate the leaf along a path from the root of the tree. Somewhat related is the concept of a forest which is a representation that consists of a collection of maximal blocks. It is reviewed and refined to enable the representation of a… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 62 CITATIONS, ESTIMATED 37% COVERAGE

166 Citations

0102030'84'91'99'07'15
Citations per Year
Semantic Scholar estimates that this publication has 166 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
SHOWING 1-4 OF 4 REFERENCES

Comment on the explicit quadtree as a structure for computer

  • Burton, F.W, J. G. Kollias
  • graphics. Comput. 1
  • 1983
Highly Influential
10 Excerpts

The structural and algorithmic basis of a geographic data

  • B. C. Cook
  • Proceedings of fhe first International Advanced…
  • 1978
Highly Influential
10 Excerpts

Similar Papers

Loading similar papers…