Advertisement

An optimal quadtree translation algorithm

  • Chuan-Heng Ang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 692)

Abstract

Many operations on maps such as windowing and map overlaying require the maps to be translated. Therefore an efficient algorithm used to translate a map is very important in any application dealing with maps, GIS in particular. In this paper, an optimal algorithm that runs in O(s in +s out ) is described and analyzed where s in and s out denote the number of nodes in the quadtree of the map and that of the translated map.

Keywords

Time Complexity Active Node Input Node Geographic Information System Locational Code 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    C.R. Dyer, The space efficiency of quadtrees, Computer Graphics and Image Processing 19, 4(August 1982), 335–348.Google Scholar
  2. 2.
    I. Gargantini, An effective way to represent quadtrees, Communications of the ACM 25, 12(December 1982), 905–910.Google Scholar
  3. 3.
    I. Gargantini, Translation, rotation, and superposition of linear quadtrees, International Journal of Man-Machine Studies 18, 3(March 1983), 253–263.Google Scholar
  4. 4.
    G.M. Hunter, Efficient computation and data structures for graphics, Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, NJ, 1978.Google Scholar
  5. 5.
    M. Li, W.I. Grosky, and R. Jain, Normalized quadtrees with respect to translation, Computer Graphics and Image Processing 20, 1(September 1982), 72–81.Google Scholar
  6. 6.
    M.L.P. van Lierop, Geometrical transformations on pictures represented by leafcodes, Computer Vision, Graphics, and Image Processing 33, 1(January 1986), 81–98.Google Scholar
  7. 7.
    F. Peters, An algorithm for transformations on pictures represented by quadtrees, Computer Vision, Graphics, and Image Processing 32, 3 (December 1985), 397–403.Google Scholar
  8. 8.
    H. Samet, The Design and Analysis of Spatial Data Structures, Addison Wesley, Reading, Massachusetts, 1990.Google Scholar
  9. 9.
    H. Samet, Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS, Addison Wesley, Reading, Massachusetts, 1990.Google Scholar
  10. 10.
    C.A. Shaffer, Application of alternative quadtree representations, Ph.D. dissertation, TR-1672, computer science Department, University of Maryland, College Park, MD, June 1986.Google Scholar
  11. 11.
    C.A. Shaffer and H. Samet, Set operations for unaligned linear quadtrees, Computer Vision, Graphics, and Image Processing 50, 1(April 1990), 29–49.Google Scholar
  12. 12.
    A. Touir and B. Kerherve, Pattern translation in images encoded by linear quadtree, Modeling in Computer Graphics, Proceedings of the IFIP WG 5.10 working conference, Tokyo, Japan, April 8–12, 1991.Google Scholar
  13. 13.
    T.R. Walsh, Efficient axis-translation of binary digital pictures by blocks in linear quadtrees representation, Computer Vision, Graphics, and Image Processing 41, 3(March 1988), 282–292.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Chuan-Heng Ang
    • 1
  1. 1.Department of Information Systems and Computer ScienceNational University of SingaporeSingapore

Personalised recommendations