Using linear quadtrees to store vector data

  • Hanan Samet
  • Clifford A. Shaffer
  • Robert E. Webber
Conference paper
Part of the EurographicSeminars book series (FOCUS COMPUTER)


The linear quadtree is adapted to store vector data by defining a new data structure called a segment quadtree. It uses a constant or bounded, amount of storage per node, represents straight lines exactly (i.e., it is not a digitized representation), and enables updates in a consistent manner (i.e., when a vector feature is deleted, the database can be restored to the state it would have been in had the deleted feature never been inserted). The segment quadtree is shown to meet these requirements whereas existing quadtree-like methods (e.g., the edge quadtree, strip tree, etc.) fail to satisfy them. In order to illustrate the usefulness of the segment quadtree, sample algorithms are discussed to insert and delete line segments as well as perform boundary following. The space requirements of segment quadtrees are also investigated.


Vector Feature Line Segment Leaf Node Vector Data Line Node 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Aho74]
    A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.MATHGoogle Scholar
  2. [Ball8l]
    D.H. Ballard, Strip trees: A hierarchical representation for curves, Communications of the ACM 24, 5(May 1981), 310–321 (see also corrigendum, Communications of the ACM 25, 3(March 1982), 213).CrossRefGoogle Scholar
  3. [Garg82]
    I. Gargantini, An effective way to represent quadtrees, Communications of the ACM 25, 12(December 1982), 905–910.MATHCrossRefGoogle Scholar
  4. [Hunt79]
    G.M. Hunter and K. Steiglitz, Operations on images using quad trees, IEEE Transactions on Pattern Analysis and Machine Intelligence 1, 2(April 1979), 145–153.CrossRefGoogle Scholar
  5. [Klin7l]
    A. Klinger, Patterns and search statistics, in Optimizing Methods in Statistics, J.S. Rustagi, ED., Academic Press, New York, 1971, 303–337.Google Scholar
  6. [Oren82]
    J.A. Orenstein, Multidimensional tries used for associative searching, Information Processing Letters 14, 4(June 1982), 150–157.CrossRefGoogle Scholar
  7. [Same82]
    H. Samet, Neighbor finding techniques for images represented by quadtrees, Computer Graphics and Image Processing 18, 1 (January 1982), 37–57.MATHCrossRefGoogle Scholar
  8. [Same84a]
    H. Samet, The quadtree and related hierarchical data structures, ACM Computing Surveys 16, 2(June 1984), 187–260.MathSciNetCrossRefGoogle Scholar
  9. [Same84b]
    H. Samet and R.E. Webber, On encoding boundaries with quadtrees, IEEE Transactions on Pattern Analyg)c and Machine Intelligence 6, 3(May 1984), 365–369.CrossRefGoogle Scholar
  10. [Same84c]
    H. Samet, A. Rosenfeld, C.A. Shaffer, and R.E. Webber, A geographic information system using quadtrees, Pattern Recognition 17, 6 (November/December 1984), 647–656.CrossRefGoogle Scholar
  11. [Same85a]
    H. Samet and C.A. Shaffer, A model for the analysis of neighbor finding in pointer-based quadtrees, to appear in IEEE Transactions on Pattern Analysis and Machine Intelligence, 1985 (see also University of Maryland Computer Science TR-1432).Google Scholar
  12. [Same85b]
    H. Samet and R. E. Webber, Storing a collection of polygons using quadtrees, to appear in ACM Transactions on Graphics, 1985 (see also Proceedings of Computer Vision arid Pattern Recognition 83, Washington, DC, June 1983, 127–132 and University of Maryland Computer Science TR-1372).Google Scholar
  13. [Shne81]
    M. Shneier, Two hierarchical linear feature representations: edge pyramids and edge quadtrees, Computer Graphics and Image Processing 17, 3(November 1981), 211–224.CrossRefGoogle Scholar

Copyright information

© EUROGRAPHICS The European Association for Computer Graphics 1986

Authors and Affiliations

  • Hanan Samet
    • 1
  • Clifford A. Shaffer
    • 1
  • Robert E. Webber
    • 2
  1. 1.Computer Science Department and Center for Automation ResearchUniversity of Maryland College ParkMarylandUSA
  2. 2.Computer Science Department Rutgers University, Busch Campus New BrunswickNew JerseyUSA

Personalised recommendations