Skip to main content
SpringerLink
Log in

Orthogonal polygons as bounding structures in filter-refine query processing strategies

  • Spatial Query Processing
  • Conference paper
  • First Online:
Advances in Spatial Databases (SSD 1997)

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

Included in the following conference series:

Abstract

The use of bounding structures in the form of orthogonal polygons (also known as rectilinear polygons) with a varying number of vertices in contrast with a minimum bounding rectangle (an orthogonal polygon with just 4 vertices in two dimensions) as an object approximation method is presented. Orthogonal polygons can be used to improve the performance of the refine step in the filter-refine query processing strategy employed in spatial databases. The orthogonal polygons are represented using the vertex representation implemented as a vertex list. The advantage of the vertex representation implemented as a vertex list is that it can be used to represent orthogonal polygons in arbitrary dimensions using just their vertices. This is in contrast to conventional methods such as the chain code which only work in two dimensions and cannot be extended to deal with higher dimensional data. Algorithms are given for varying the number of vertices used to represent the objects. It is shown that the use of non-trivial orthogonal polygons (i.e., with more than four vertices) is of benefit when a spatial index is used in the filter step for processing spatial queries such as point-in-object and windowing. If no spatial index is used, then all objects must be examined. In this case, many of the objects are small thereby not benefiting from the variation in the number of vertices that they have as the simple bounding box is adequate.

The support of Conselho Nacional de Desenvolvimento Científico e Tecnologico (CNPq), Projeto GEOTEC/PROTEM II is gratefully acknowledged.

The support of the National Science Foundation under Grant IRI-92-16970 is gratefully acknowledged.

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. B. G. Baumgart. Geometric modeling for computer vision. Stanford Artificial Intelligence Laboratory Memo AIM-249 STAN-CS-74-463, Stanford University, Stanford, CA, October 1974.

    Google Scholar 

  2. N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger. The R*-tree: an efficient and robust access method for points and rectangles. In Proceedings of the SIGMOD Conference, pages 322–331, Atlantic City, NJ, June 1990.

    Google Scholar 

  3. T. Brinkhoff, H. P. Kriegel, R. Schneider, and B. Seeger. Multi-step processing of spatial joins. In Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data, pages 197–208, Minneapolis, MN, June 1994.

    Google Scholar 

  4. A. Brodsky, C. Lassez, J. Lassez, and M. J. Maher. Separability of polyhedra for optimal filtering of spatial and constraint data. In Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 54–65, San Jose, CA, May 1995.

    Google Scholar 

  5. H. Edelsbrunner, J. O'Rourke, and E. Welzl. Stationing guards in rectilinear art galleries. Computer Vision, Graphics, and Image Processing, 27(2):167–176, August 1984.

    Google Scholar 

  6. C. Esperança. Orthogonal Objects and their Application in Spatial Databases. PhD thesis, University of Maryland, December 1995. (also available as Technical Report TR-3566, University of Maryland, College Park, MD).

    Google Scholar 

  7. H. Freeman. Computer processing of line-drawing images. ACM Computing Surveys, 6(1):57–97, March 1974.

    Google Scholar 

  8. V. Gaede. Optimal redundancy in spatial database systems. In M. J. Egenhofer and J. R. Herring, editors, Advances in Spatial Databases — Fourth International Symposium, SSD'95, pages 96–116, Portland, ME, August 1995. (also Springer Verlag Lecture Notes in Computer Science 951).

    Google Scholar 

  9. R. C. Gonzalez and R. E. Woods. Digital Image Processing. Addison-Wesley, Reading, MA, June 1992.

    Google Scholar 

  10. R. H. Güting. An introduction to spatial database systems. Special Issue on Spatial Database Systems of the VLDB Journal, 3(4), October 1994.

    Google Scholar 

  11. A. Guttman. R-trees: a dynamic index structure for spatial searching. In Proceedings of the SIGMOD Conference, pages 47–57, Boston, MA, June 1984.

    Google Scholar 

  12. G. M. Hunter. Efficient computation and data structures for graphics. PhD thesis, Princeton University, Princeton, NJ, 1978.

    Google Scholar 

  13. H. V. Jagadish. Spatial search with polyhedra. In Proceedings of the Sixth IEEE International Conference on Data Engineering, pages 311–319, Los Angeles, February 1990.

    Google Scholar 

  14. A. Klinger. Patterns and search statistics. In J. S. Rustagi, editor, Optimizing Methods in Statistics, pages 303–337. Academic Press, New York, 1971.

    Google Scholar 

  15. G. D. Knott and E. D. Jou. A program to determine whether two line segments intersect. Department of Computer Science TR-1884, University of Maryland, College Park, July 1987.

    Google Scholar 

  16. M. Mäntylä. An Introduction to solid Modeling. Computer Science Press, Rockville, MD, 1987.

    Google Scholar 

  17. J. Nievergelt and P. Schorn. Das ratsel der verzopften geraden. Informatik-Spektrum, 11:163–165, 1988. (in German).

    Google Scholar 

  18. J. A. Orenstein. Redundancy in spatial databases. In Proceedings of the SIGMOD Conference, pages 294–305, Portland, OR, June 1989.

    Google Scholar 

  19. J. O'Rourke. Computational Geometry in C. Cambridge University Press, 1994.

    Google Scholar 

  20. F. P. Preparata and M. I. Shamos. Computational Geometry: An Introduction. Springer-Verlag, New York, 1985.

    Google Scholar 

  21. N. Roussopoulos, S. Kelley, and F. Vincent. Nearest neighbor queries. In Proceedings of the ACM SIGMOD Conference, pages 71–79, San Jose, CA, May 1995.

    Google Scholar 

  22. H. Samet. Applications of Spatial Data Structures: Computer Graphics, Image Processing, and GIS. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  23. H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.

    Google Scholar 

  24. J. Shechtman. Processamento geométrico de máscaras VLSI. Master's thesis, Eng. Elétrica, Universidade Federal do Rio de Janeiro, Rio de Janeiro, April 1991.

    Google Scholar 

  25. M. Stonebraker, T. Sellis, and E. Hanson. An analysis of rule indexing implementations in data base systems. In Proceedings of the First International Conference on Expert Database Systems, pages 353–364, Charleston, SC, April 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. COPPE, Prog. Eng. Sistemas, Universidade Federal do Rio de Janeiro Cidade Universitária, C.T., Sala H319, 21945-970, Rio de Janeiro, RJ, Brazil

    Claudio Esperança

  2. Computer Science Department and Center for Automation Research and Institute for Advanced Computer Science, University of Maryland at College Park, 20742, College Park, Maryland

    Hanan Samet

Authors
  1. Claudio Esperança
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hanan Samet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Scholl Agnès Voisard

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Esperança, C., Samet, H. (1997). Orthogonal polygons as bounding structures in filter-refine query processing strategies. In: Scholl, M., Voisard, A. (eds) Advances in Spatial Databases. SSD 1997. Lecture Notes in Computer Science, vol 1262. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63238-7_31

Download citation

  • DOI: https://doi.org/10.1007/3-540-63238-7_31

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63238-2

  • Online ISBN: 978-3-540-69240-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation