Skip to main content
SpringerLink
Log in

The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations

  • Conference paper
  • First Online:
Computational Geometry-Methods, Algorithms and Applications (CG 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 553))

Included in the following conference series:

Abstract

In application areas such as graphics and image processing, computer aided design (CAD) as well as geography and cartography complex and time consuming spatial queries and operations have to be performed on polygonal objects. In the area of computational geometry different specialized data structures and techniques, such as plane sweep or divide and conquer, are used to design efficient algorithms for the different queries and operations. In this paper, we propose a new representation of polygonal objects, called the TR*-tree that efficiently supports various types of spatial queries and operations. The TR*-tree is a dynamic data structure that represents single objects as well as scenes of objects. The TR*-tree representations of polygonal objects are persistently stored on secondary storage and they are completely loaded into main memory for efficient query processing. In an experimental performance analysis, we demonstrate the fruitfulness of using TR*-trees investigating the ‘Point in Polygon’-query and the ‘Intersection of two Polygons’-operation.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asano, Ta. & Te. Asano, ‘Minimum Partition of Polygonal Regions into Trapezoids', in Proc. 24th IEEE Annual Symposium on Foundations of Computer Science, 233–241, 1983.

    Google Scholar 

  2. N. Beckmann, H.-P. Kriegel, R. Schneider, B. Seeger:’ The R*-tree: An Efficient and Robust Access Method for Points and Rectangles', Proc. ACM SIGMOD Int. Conf. on Management of Data, 322–331, 1990.

    Google Scholar 

  3. P.A. Burrough:’ Principles of Geographical Information Systems for Land Resources Assessment', Oxford University Press, 1986

    Google Scholar 

  4. D.G. Gorny & Russ Carter World Data Bank II, General users Guide. Technical Report, U.S. Central Intelligence Agency, 1987.

    Google Scholar 

  5. Guttman A.,’ R-trees: a dynamic index structure for spatial searching', in Proc. ACM SIGMOD Int. Conf. on Management of Data, 47–57, June 1984.

    Google Scholar 

  6. H.-P. Kriegel, T. Brinkhoff, R. Schneider:’ An Efficient Map Overlay Algorithm based on Spatial Access Methods and Computational Geometry', Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16–17, 1991

    Google Scholar 

  7. H.-P. Kriegel, P. Heep, S. Heep, M. Schiwietz, R. Schneider:’ An Access Method Based Query Processor for Spatial Database Systems', Proc. Int. Workshop on DBMS's for geographical applications, Capri, May 16–17, 1991

    Google Scholar 

  8. Kriegel, H.P., H. Horn & M. Schiwietz:’ The Performance of Object Decomposition Techniques for Spatial Query Processing', Proc. 2nd Symposium on Large Spatial Databases, Zurich, August 28–30, 1991

    Google Scholar 

  9. H.-P. Kriegel, M. Schiwietz, R. Schneider, B. Seeger:’ Performance Comparison of Point and Spatial Access Methods', Proc. 1st Symp. on the Design of Large Spatial Databases, 1989 (Lecture Notes in Computer Science 409, Springer, 89–114, 1990)

    Google Scholar 

  10. J. Nievergelt, F.P. Preparata:’ Plane-Sweep Algorithms for Intersecting Geometric Figures', Comm. of the ACM, Vol. 25, No. 10, 739–747, 1982

    Google Scholar 

  11. P.J.M. Oosterom:’ Reactive Data Structures for Geographic Information Systems', PhD-thesis, Department of Computer Science at Leiden University, 1990

    Google Scholar 

  12. F.P. Preparata, M.I. Shamos:’ Computational Geometry', Springer, 1988

    Google Scholar 

  13. Scholl, M. & A. Voisard,’ Thematic Map Modelling', in Proc. “Symposium on the Design and Implementation of Large Spatial Databases”, 167–190, Santa Barbara, USA, July 1989.

    Google Scholar 

  14. R.B. Tilove:’ Set Membership Classification: A Unified Approach to Geometric Intersection Problems', IEEE Trans. on Computers, Vol. C-29, No. 10, 874–883, 1980

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Universität München, Leopoldstr. 11B, D-8000, München 40, Germany

    Ralf Schneider & Hans-Peter Kriegel

Authors
  1. Ralf Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hans-Peter Kriegel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

H. Bieri H. Noltemeier

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schneider, R., Kriegel, HP. (1991). The TR*-tree: A new representation of polygonal objects supporting spatial queries and operations. In: Bieri, H., Noltemeier, H. (eds) Computational Geometry-Methods, Algorithms and Applications. CG 1991. Lecture Notes in Computer Science, vol 553. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54891-2_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-54891-2_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54891-1

  • Online ISBN: 978-3-540-46459-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation