Overlaying Multiple Maps Efficiently

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.

[1]  Christos Faloutsos,et al.  Spatial join selectivity using power laws , 2000, SIGMOD 2000.

[2]  Majid Sarrafzadeh,et al.  Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering vor VLSI Applications , 1998, IEEE Trans. Computers.

[3]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[4]  Hans-Peter Kriegel,et al.  An Efficient Map Overlay Algorithm Based on Spatial Access Methods and Computational Geometry , 2000 .

[5]  Klaus H. Hinrichs,et al.  Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets , 1999, SSD.

[6]  Dimitris Papadias,et al.  Selectivity Estimation of Complex Spatial Queries , 2001, SSTD.

[7]  Niklaus Wirth,et al.  Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.

[8]  Dimitris Papadias,et al.  Processing and optimization of multiway spatial joins using R-trees , 1999, PODS '99.

[9]  Walid G. Aref,et al.  A Cost Model for Query Optimization Using R-Trees , 1994, ACM-GIS.

[10]  Doron Rotem,et al.  Sampling from spatial databases , 1993, Proceedings of IEEE 9th International Conference on Data Engineering.

[11]  Ivan J. Balaban,et al.  An optimal algorithm for finding segments intersections , 1995, SCG '95.

[12]  Christos Faloutsos,et al.  Self-spacial join selectivity estimation using fractal concepts , 1998, TOIS.

[13]  Gershon Kedem,et al.  The quad-cif tree a data structure for h , 1981, DAC 1982.

[14]  Teofilo F. Gonzalez,et al.  P-Complete Approximation Problems , 1976, J. ACM.

[15]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[16]  Leonidas J. Guibas,et al.  Algorithms for bichromatic line-segment problems and polyhedral terrains , 1994, Algorithmica.

[17]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

[18]  Giorgio Gambosi,et al.  Geographic Database Management Systems , 1992 .

[19]  Timothy M. Chan.  A Simple Trapezoid Sweep Algorithm for Reporting Red/Blue Segment Intersections , 1994, CCCG.

[20]  Ketan Mulmuley,et al.  A fast planar partition algorithm. I , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[21]  Yannis Manolopoulos,et al.  On Sampling Regional Data , 1997, Data Knowl. Eng..

[22]  David P. Williamson,et al.  .879-approximation algorithms for MAX CUT and MAX 2SAT , 1994, STOC '94.

[23]  Bernard Chazelle,et al.  An optimal algorithm for intersecting line segments in the plane , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[24]  Rae A. Earnshaw,et al.  Theoretical Foundations of Computer Graphics and CAD , 1988, NATO ASI Series.

[25]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[26]  Shankar M. Venkatesan,et al.  Approximation and Intractability Results for the Maximum Cut Problem and its Variants , 1991, IEEE Trans. Computers.

[27]  Ulrich Finke,et al.  Overlaying simply connected planar subdivisions in linear time , 1995, SCG '95.

[28]  David S. Johnson,et al.  Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[29]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[30]  Divyakant Agrawal,et al.  Selectivity Estimation for Spatial Joins with Geometric Selections , 2002, EDBT.

[31]  Jack Snoeyink,et al.  Counting and Reporting Red/Blue Segment Intersections , 1993, WADS.

[32]  Anand Sivasubramaniam,et al.  Selectivity estimation for spatial joins , 2001, Proceedings 17th International Conference on Data Engineering.

[33]  Nick Koudas,et al.  Filter Trees for Managing Spatial Data over a Range of Size Granularities , 1996, VLDB.

[34]  Man-Tak Shing,et al.  Computation of Matrix Chain Products. Part II , 1984, SIAM J. Comput..