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).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
J. L. Bentley, T. A. Ottmann: Algorithms for reporting and counting geometric intersections, IEEE Transactions on Computers, C-28 (9), 643–647 (1979).
A. U. Frank: Overlay Processing in Spatial Information Systems, Proc. 8th Int. Symposium on Computer-Assisted Cartography (AUTO-CARTO 8), 1987, 16–31.
A. Guttman: A dynamic index structure for spatial searching, Proc. of ACM SIGMOD Conference on Management of Data, Boston, 1984, 47–57.
O. Günther: Efficient Structures for Geometric Data Management, Lecture Notes in Computer Science 337, Springer-Verlag, 1988.
L. J. Guibas, R. Seidel: Computing Convolutions by Reciprocal Search, 2nd ACM Symposium on Computational Geometry, 1986, 90–99.
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.
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.
J. Nievergelt, F. P. Preparata: Plane sweep algorithms for intersecting geometric figures, Communications of the ACM, 25 (10), 739–747 (1982).
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.
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.
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.
C. D. Tomlin: Geographic Information Systems and Cartographic Modeling, Prentice Hall, Englewood Cliffs, NJ, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Finke, U., Hinrichs, K. (1993). A spatial data model and a topological sweep algorithm for map overlay. In: Abel, D., Chin Ooi, B. (eds) Advances in Spatial Databases. SSD 1993. Lecture Notes in Computer Science, vol 692. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56869-7_10
Download citation
DOI: https://doi.org/10.1007/3-540-56869-7_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56869-8
Online ISBN: 978-3-540-47765-5
eBook Packages: Springer Book Archive