Advertisement

A spatial data model and a topological sweep algorithm for map overlay

  • Ulrich Finke
  • Klaus Hinrichs
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 692)

Abstract

One of the most general query problems in spatial information processing is the map overlay operation that computes from one or more thematic map layers a new map by using an overlay function. Existing algorithms for vector-based map overlay operations suffer from one or more of the following disadvantages: lacking generality, inefficiency or poor adaptability to existing GIS-Systems. Furthermore only few proposals for parallel implementations of this operation have been made. In this paper we present a model for planar subdivisions similar to the well-known arc model. This model can be easily adapted to existing spatial access methods. Our overlay algorithm uses an overlay function and includes a fine-grain parallelism. The homogeneous structure of input and output maps allows pipelining of map overlay operations (coarse-grain parallelism).

Keywords

Geographic information systems cartographic modeling map overlay computational geometry topological plane sweep parallel processing 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    N. Beckmann, H. P. Kriegel, R. Schneider, B. Seeger: The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Proc. of ACM SIGMOD Conference on Management of Data, 1990, 322–331.Google Scholar
  2. 2.
    J. L. Bentley, T. A. Ottmann: Algorithms for reporting and counting geometric intersections, IEEE Transactions on Computers, C-28 (9), 643–647 (1979).Google Scholar
  3. 3.
    A. U. Frank: Overlay Processing in Spatial Information Systems, Proc. 8th Int. Symposium on Computer-Assisted Cartography (AUTO-CARTO 8), 1987, 16–31.Google Scholar
  4. 4.
    A. Guttman: A dynamic index structure for spatial searching, Proc. of ACM SIGMOD Conference on Management of Data, Boston, 1984, 47–57.Google Scholar
  5. 5.
    O. Günther: Efficient Structures for Geometric Data Management, Lecture Notes in Computer Science 337, Springer-Verlag, 1988.Google Scholar
  6. 6.
    L. J. Guibas, R. Seidel: Computing Convolutions by Reciprocal Search, 2nd ACM Symposium on Computational Geometry, 1986, 90–99.Google Scholar
  7. 7.
    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
  8. 8.
    H. P. Kriegel, T. Brinkhoff, R. Schneider: The Combination of Spatial Access Methods and Computational Geometry in Geographic Database Systems, Advances in Spatial Databases, 2nd Symposium, SSD'91, Lecture Notes in Computer Science 525, Springer-Verlag, 1991, 5–21.Google Scholar
  9. 9.
    J. Nievergelt, F. P. Preparata: Plane sweep algorithms for intersecting geometric figures, Communications of the ACM, 25 (10), 739–747 (1982).Google Scholar
  10. 10.
    J. Orenstein: An Algorithm for Computing the Overlay of k-Dimensional Spaces, Advances in Spatial Databases, 2nd Symposium, SSD'91, Lecture Notes in Computer Science 525, Springer-Verlag, 1991, 381–400.Google Scholar
  11. 11.
    J. W. van Roessel: Attribute Propagation And Line Segment Classification in Plane-Sweep Overlay, Proc. 4th Int. Symposium on Spatial Data Handling, Vol. 1, 1990, 127–140.Google Scholar
  12. 12.
    T. Sellis, N. Roussopoulos, C. Faloutsos: The R+-tree: A dynamic index for multi-dimensional objects, Proc. 13th International Conference on Very Large Data Bases, Brighton, England, 1987.Google Scholar
  13. 13.
    C. D. Tomlin: Geographic Information Systems and Cartographic Modeling, Prentice Hall, Englewood Cliffs, NJ, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Ulrich Finke
    • 1
  • Klaus Hinrichs
    • 1
  1. 1.FB 15, InformatikWestfälische Wilhelms-UniversitätMünsterGermany

Personalised recommendations