Skip to main content
SpringerLink
Log in

Implementing Maps: Map2D

  • Chapter
  • First Online:
Map Framework

  • 397 Accesses

Abstract

At this point, we have an abstract model of the Map Framework that precisely defines the semantics of maps and their operations and predicates. Furthermore, we have shown how to represent maps in a discrete manner such that they maintain the properties of the abstract model. In this chapter, we provide an implementation model of the Map Framework consisting of a data model for maps and algorithms for computing map operations. Furthermore, we show how operations over maps can be combined to form new map operations.

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 EPUB and 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
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Arge, L., Procopiuc, O., Ramaswamy, S., Suel, T., Vitter, J.S.: Scalable sweeping-based spatial join. In: VLDB, vol. 98, pp. 570–581. Citeseer (1998)

    Google Scholar 

  2. Audet, S., Albertsson, C., Murase, M., Asahara, A.: Robust and efficient polygon overlay on parallel stream processors. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 304–313. ACM (2013)

    Google Scholar 

  3. Balaban, I.J.: An optimal algorithm for finding segments intersections. In: Proceedings of the eleventh annual symposium on Computational geometry, pp. 211–219. ACM (1995)

    Google Scholar 

  4. Bentley, J.L., Ottmann, T.A.: Algorithms for reporting and counting geometric intersections. Computers, IEEE Transactions on 100(9), 643–647 (1979)

    Article  MATH  Google Scholar 

  5. Chazelle, B., Edelsbrunner, H.: An optimal algorithm for intersecting line segments in the plane. Journal of the ACM (JACM) 39(1), 1–54 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chazelle, B., Edelsbrunner, H., Guibas, L.J., Sharir, M.: Algorithms for bichromatic line-segment problems and polyhedral terrains. Algorithmica 11(2), 116–132 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  7. De La Briandais, R.: File searching using variable length keys. In: Papers presented at the the March 3-5, 1959, western joint computer conference, pp. 295–298. ACM (1959)

    Google Scholar 

  8. Egenhofer, M.J.: Spatial sql: A query and presentation language. Knowledge and Data Engineering, IEEE Transactions on 6(1), 86–95 (1994)

    Article  Google Scholar 

  9. Erwig, M., Schneider, M.: Partition and conquer. In: Spatial Information Theory A Theoretical Basis for GIS, pp. 389–407. Springer (1997)

    Google Scholar 

  10. Erwig, M., Schneider, M.: Formalization of advanced map operations. In: 9th Int. Symp. on Spatial Data Handling, vol. 8, pp. 3–17 (2000)

    Google Scholar 

  11. Fredkin, E.: Trie memory. Communications of the ACM 3(9), 490–499 (1960)

    Article  Google Scholar 

  12. Goodrich, M.T.: Intersecting line segments in parallel with an output-sensitive number of processors. SIAM Journal on Computing 20(4), 737–755 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  13. Goodrich, M.T., Ghouse, M.R., Bright, J.: Sweep methods for parallel computational geometry. Algorithmica 15(2), 126–153 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  14. Güting, R.H.: An introduction to spatial database systems. The VLDB Journal The International Journal on Very Large Data Bases 3(4), 357–399 (1994)

    Google Scholar 

  15. Güting, R.H., Schilling, W.: A practical divide-and-conquer algorithm for the rectangle intersection problem. Information Sciences 42(2), 95–112 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kriegel, H.P., Brinkhoff, T., Schneider, R.: The combination of spatial access methods and computational geometry in geographic database systems. In: Advances in Spatial Databases, pp. 5–21. Springer (1991)

    Google Scholar 

  17. Mairson, H.G., Stolfi, J.: Reporting and counting intersections between two sets of line segments. In: Theoretical foundations of computer graphics and CAD, pp. 307–325. Springer (1988)

    Google Scholar 

  18. McKenney, M.: Map algebra: A data model and implementation of spatial partitions for use in spatial databases and geographic information systems. Ph.D. thesis, University of Florida (2008)

    Google Scholar 

  19. McKenney, M.: Region extraction and verification for spatial and spatio-temporal databases. In: Scientific and Statistical Database Management, pp. 598–607. Springer (2009)

    Google Scholar 

  20. McKenney, M.: Geometric and thematic integration of spatial data into maps. In: Information Reuse and Integration (IRI), 2010 IEEE International Conference on, pp. 201–206. IEEE (2010)

    Google Scholar 

  21. McKenney, M.: Algorithms for spatial data integration. Recent Trends in Information Reuse and Integration pp. 257–272 (2012)

    Google Scholar 

  22. McKenney, M.: Pyspatiotemporalgeom package. https://pypi.python.org/pypi/pyspatiotemporalgeom/ (2016). Version 0.2, Accessed: 2016-06-22

  23. McKenney, M.: Pyspatiotemporalgeom source code. https://bitbucket.org/marmcke/pyspatiotemporalgeom/ (2016). Accessed: 2016-06-22

  24. McKenney, M., De Luna, G., Hill, S., Lowell, L.: Geospatial overlay computation on the gpu. In: Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 473–476. ACM (2011)

    Google Scholar 

  25. McKenney, M., Schneider, M.: Advanced operations for maps in spatial databases. Progress in Spatial Data Handling pp. 495–510 (2006)

    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. Opengis implementation specification for geographic information - simple feature access - part 2: Sql option (2010)

    Google Scholar 

  28. Ottmann, T., Wood, D.: Space-economical plane-sweep algorithms. Computer vision, graphics, and image processing 34(1), 35–51 (1986)

    Article  Google Scholar 

  29. Palazzi, L., Snoeyink, J.: Counting and reporting red/blue segment intersections. CVGIP: Graphical Models and Image Processing 56(4), 304–310 (1994)

    Article  Google Scholar 

  30. Rigaux, P., Scholl, M., Voisard, A.: Spatial databases: with application to GIS. Morgan Kaufmann (2001)

    Google Scholar 

  31. Shamos, M.I., Hoey, D.: Geometric intersection problems. In: Foundations of Computer Science, 1976., 17th Annual Symposium on, pp. 208–215. IEEE (1976)

    Google Scholar 

  32. Shcneider, M.: Spatial Data Types for Database Systems. Springer–Verlag (1995)

    Google Scholar 

  33. Shekhar, S., Chawla, S.: Spatial databases: a tour, vol. 2003. prentice hall Upper Saddle River, NJ (2003)

    Google Scholar 

  34. Vaishnavi, V.K., Wood, D.: Rectilinear line segment intersection, layered segment trees, and dynamization. Journal of Algorithms 3(2), 160–176 (1982)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Southern Illinois University, Edwardsville, IL, USA

    Mark McKenney

  2. University of Florida, Gainesville, FL, USA

    Markus Schneider

Authors
  1. Mark McKenney
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Markus Schneider
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mark McKenney .

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing AG

About this chapter

Cite this chapter

McKenney, M., Schneider, M. (2016). Implementing Maps: Map2D. In: Map Framework. Springer, Cham. https://doi.org/10.1007/978-3-319-46766-5_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-46766-5_9

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-46764-1

  • Online ISBN: 978-3-319-46766-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation