Skip to main content
SpringerLink
Log in

Overlaying Multiple Maps Efficiently

  • Conference paper
Intelligent Information Technology (CIT 2004)

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

Included in the following conference series:

Abstract

Spatial data is often represented as layers of thematic maps. User queries often necessiate overlay operations involving these maps. Map overlay is an extensively used operation in GIS. Typical two-map overlay involves operations on a large number of polygons of each map. Many applications require overlay of more than two maps. This operation, called multiple map overlay is executed as a sequence of binary map overlay operations. The complexity of the multiple map overlay is dependent on the order in which the individual binary overlay operations are performed. In this paper, we consider the problem of determining good order in which to overlay a set of maps and propose efficient algorithms for the same.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. An, N., Yang, Z.-Y., Sivasubramaniam, A.: Selectivity estimation for spatial joins. In: Proceedings, International Conference on Data Engineering, pp. 368–375 (2001)

    Google Scholar 

  2. Aref, W., Samet, H.: A cost model for query optimization using R-Trees. In: Proceedings, ACM GIS, pp. 60–67 (1994)

    Google Scholar 

  3. Balaban, I.J.: An optimal algorithm for finding segment intersections. In: Proceedings, 11th Annual ACM Symposium on Computational Geometry, pp. 211–219 (1995)

    Google Scholar 

  4. Becker, L., Giesen, A., Hinrichs, K.H., Vahrenhold, J.: Algorithms for performing polygonal map overlay and spatial join on massive data sets. In: Proceedings, International Symposium on Spatial Databases, pp. 270–285 (1999)

    Google Scholar 

  5. Belussi, A., Faloutsos, C.: Self-spatial join selectivity estimation using fractal concepts. ACM Transactions on Information Systems 16(2), 161–201 (1998)

    Article  Google Scholar 

  6. Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. IEEE Transactions on Computers C-28, 643–647 (1979)

    Article  Google Scholar 

  7. Chan, T.: A simple trapezoid sweep algorithm for reporting red/blue segment intersections. In: Proceedings, 6th Canadian Conference on Computational Geometry, pp. 263–268 (1994)

    Google Scholar 

  8. Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. In: Proceedings, 29th Annual IEEE Symposium on Foundations of Computer Science, pp. 590–600 (1988)

    Google Scholar 

  9. Chazelle, B., Edelsbrunner, H., Guibas, L., Sharir, M.: Algorithms for bichromatic line segment problems and polyhedral terrains. Report UIUC DCS-R-90-1578, Department of Computer Science, University of Illinois, Urbana, IL (1989)

    Google Scholar 

  10. Cho, J.D., Raje, S., Sarrafzadeh, M.: Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering for VLSI Applications. IEEE Transactions on Computers 47(11), 1253–1256 (1998)

    Article  MathSciNet  Google Scholar 

  11. Clarkson, K.L., Shor, P.: Applications of random sampling in computational geometry II. Discrete Computational Geometry 4, 387–421 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  12. Dorenbeck, C., Egenhofer, M.J.: Algebraic optimization of combined operations. In: Proceedings, 10th Auto-Carto, pp. 296–312 (1991)

    Google Scholar 

  13. Faloutsos, C., Seeger, B., Traina, A., Traina, C.: Spatial join selectivity using power laws. In: Proceedings, ACM SIGMOD, pp. 177–188 (2000)

    Google Scholar 

  14. Finke, U., Hinrichs, K.: Overlaying simply connected planar subdivisions in linear time. In: Proceedings, 11th Annual ACM Symposium on Computational Geometry, pp. 119–126 (1995)

    Google Scholar 

  15. Garey, M.R., Johnson, D.S.: Computers and Intractibility: A guide to the theory of NP-Completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  16. Garey, M.R., Johnson, D.S., Stickmeyer, L.: Some simplified NP-complete graph problems. Theoretical Computer Science 1, 237–267 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  17. Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. In: Proceedings, ACM STOC, pp. 422–431 (1994)

    Google Scholar 

  18. Haglin, D.J., Venkatesan, S.M.: Approximation and intractability results for the maximum cut problem and its variants. IEEE Transactions on Computers 40(1), 110–113 (1991)

    Article  MathSciNet  Google Scholar 

  19. Hu, T.C., Shing, M.T.: Computation of matrix chain products, Part I. SIAM Journal on Computing 11(2), 362–373 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  20. Hu, T.C., Shing, M.T.: Computation of matrix chain products, Part II. SIAM Journal on Computing 13(2), 228–251 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  21. Kriegel, H.-P., Brinkhoff, T., Schneider, R.: An efficient map overlay algorithm based on spatial access methods and computational geometry. In: Gambosi, G., Scholl, M., Six, H.-W. (eds.) Geographic Database Management Systems, pp. 194–211. Springer, Heidelberg (1992)

    Google Scholar 

  22. Kedem, G.: The quad-CIF tree: A data structure for hierarchical on-line algorithms. In: Proceedings, ACM IEEE Design Automation Conference, pp. 352–357 (1982)

    Google Scholar 

  23. Mairson, H.G., Stolfi, J.: Reporting and counting intesrections between two sets of line segments. In: Earnshaw, R.A. (ed.) Theoretical Foundations of Computer Graphics and CAD, pp. 307–325. Springer, Heidelberg (1987)

    Google Scholar 

  24. Mamoulis, N., Papadias, D.: Selectivity estimation for complex spatial queries. In: Proceedings 7th International Symposium on Spatial and Temporal Databases, pp. 155–174 (2001)

    Google Scholar 

  25. Mulmuley, M.: A fast planar partition algorithm I. In: Proceedings, 29th Annual IEEE Symposium on Foundations of Computer Science, pp. 580–589 (1988)

    Google Scholar 

  26. Nievergelt, J., Preparata, F.P.: Plane-sweep algorithms for intersecting geometric figures. Communications of the ACM 25(10), 739–747 (1982)

    Article  MATH  Google Scholar 

  27. Olken, F., Rotem, D.: Sampling from spatial databases. In: Proceedings, International Conference on Data Engineering, pp. 199–208 (1993)

    Google Scholar 

  28. Palazzi, L., Snoeyink, J.: Counting and reporting red/blue segment intersections. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1993. LNCS, vol. 709, Springer, Heidelberg (1993)

    Google Scholar 

  29. Papadias, D., Mamoulis, N., Theodoridis, Y.: Processing and optimization of multiway spatial joins using R-trees. In: Proceedings, ACM Symposium on Principles of Database Systems, pp. 44–55 (1999)

    Google Scholar 

  30. Sahni, S., Gonzalez, T.F.: P-Complete Approximation. Journal of the ACM 23, 555–565 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  31. Sevcik, K.C., Koudas, N.: Filter trees for Managing Spatial Data Over a Range of Size Granularities. In: Proceedings, 22nd VLDB Conference (1996)

    Google Scholar 

  32. Sun, C., Agrawal, D., El Abbadi, A.: Selectivity estimation for spatial joins with geometric selections. In: Proceedings, International Conference on Extending Database Technology, pp. 609–626 (2002)

    Google Scholar 

  33. Szymanski, T.G., van Wyk, C.J.: Layout Analysis and Verification. In: Preas, B., Lorenzetti, M. (eds.) Physical Design Automation of VLSI Systems, Benjamin/ Cummins, pp. 347–407 (1988)

    Google Scholar 

  34. Vassilakopoulos, M., Manolopoulos, Y.: On sampling region data. DKE 22(3), 309–318 (1997)

    Article  Google Scholar 

  35. Yost, M., Skelton, B.: Programming Language Technology for Raster GIS Modeling. Proceedings, GIS/LIS 1, 319–327 (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Institute of Information Technology, Gachibowli, Hyderabad, 500019, India

    Ravindranath Jampani, Risivardhan Thonangi & Prosenjit Gupta

Authors
  1. Ravindranath Jampani
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Risivardhan Thonangi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Prosenjit Gupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Sc and Engineering, University of Texas At Arlington, TX-76019, Arlington

    Gautam Das

  2. Tata Consultancy Services, Software Units Layout, Madhapur, 500081, Hyderabad, India

    Ved Prakash Gulati

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jampani, R., Thonangi, R., Gupta, P. (2004). Overlaying Multiple Maps Efficiently. In: Das, G., Gulati, V.P. (eds) Intelligent Information Technology. CIT 2004. Lecture Notes in Computer Science, vol 3356. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30561-3_28

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30561-3_28

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24126-3

  • Online ISBN: 978-3-540-30561-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation