Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Using linear quadtrees to store vector data

  • Conference paper
Data Structures for Raster Graphics

Part of the book series: EurographicSeminars ((FOCUS COMPUTER))

Abstract

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.

This work was supported in part by the National Science Foundation under Grant DCR-8 3-02118 and in part by the U.S. Army Engineer Topographic Laboratory under contract 70-81-C-0059.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

    MATH  Google Scholar 

  2. 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).

    Article  Google Scholar 

  3. I. Gargantini, An effective way to represent quadtrees, Communications of the ACM 25, 12(December 1982), 905–910.

    Article  MATH  Google Scholar 

  4. 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.

    Article  Google Scholar 

  5. 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. J.A. Orenstein, Multidimensional tries used for associative searching, Information Processing Letters 14, 4(June 1982), 150–157.

    Article  Google Scholar 

  7. H. Samet, Neighbor finding techniques for images represented by quadtrees, Computer Graphics and Image Processing 18, 1 (January 1982), 37–57.

    Article  MATH  Google Scholar 

  8. H. Samet, The quadtree and related hierarchical data structures, ACM Computing Surveys 16, 2(June 1984), 187–260.

    Article  MathSciNet  Google Scholar 

  9. 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.

    Article  Google Scholar 

  10. 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.

    Article  Google Scholar 

  11. 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. 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. M. Shneier, Two hierarchical linear feature representations: edge pyramids and edge quadtrees, Computer Graphics and Image Processing 17, 3(November 1981), 211–224.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department and Center for Automation Research, University of Maryland College Park, 20742, Maryland, USA

    Hanan Samet & Clifford A. Shaffer

  2. Computer Science Department Rutgers University, Busch Campus New Brunswick, New Jersey, 08903, USA

    Robert E. Webber

Authors
  1. Hanan Samet
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Clifford A. Shaffer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert E. Webber
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Technology Eindhoven Computing Center, P.O. Box 513, NL-5600 MB, Eindhoven, Netherlands

    Laurens R. A. Kessener

  2. PHILIPS Corporate ISA CAD Centre, P.O. Box 218, NL-5600 MD, Eindhoven, Netherlands

    Frans J. Peters

  3. Department of Mathematics and Computing Science, University of Technology Eindhoven, P.O. Box 513, NL-5600 MB, Eindhoven, Netherlands

    Marloes L. P. van Lierop

Rights and permissions

Reprints and permissions

Copyright information

© 1986 EUROGRAPHICS The European Association for Computer Graphics

About this paper

Cite this paper

Samet, H., Shaffer, C.A., Webber, R.E. (1986). Using linear quadtrees to store vector data. In: Kessener, L.R.A., Peters, F.J., van Lierop, M.L.P. (eds) Data Structures for Raster Graphics. EurographicSeminars. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-71071-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-71071-1_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-71073-5

  • Online ISBN: 978-3-642-71071-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation