Computation of matrix chain products. Part II
SIAM Journal on Computing
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Approximation and Intractability Results for the Maximum Cut Problem and Its Variants
IEEE Transactions on Computers
.879-approximation algorithms for MAX CUT and MAX 2SAT
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Overlaying simply connected planar subdivisions in linear time
Proceedings of the eleventh annual symposium on Computational geometry
An optimal algorithm for finding segments intersections
Proceedings of the eleventh annual symposium on Computational geometry
Data & Knowledge Engineering
Self-spacial join selectivity estimation using fractal concepts
ACM Transactions on Information Systems (TOIS)
Processing and optimization of multiway spatial joins using R-trees
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Fast Approximation Algorithms on Maxcut, k-Coloring, and k-Color Ordering for VLSI Applications
IEEE Transactions on Computers
P-Complete Approximation Problems
Journal of the ACM (JACM)
Spatial join selectivity using power laws
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Selectivity Estimation for Spatial Joins with Geometric Selections
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
Sampling from Spatial Databases
Proceedings of the Ninth International Conference on Data Engineering
Selectivity Estimation for Spatial Joins
Proceedings of the 17th International Conference on Data Engineering
Counting and Reporting Red/Blue Segment Intersections
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
Filter Trees for Managing Spatial Data over a Range of Size Granularities
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Selectivity Estimation of Complex Spatial Queries
SSTD '01 Proceedings of the 7th International Symposium on Advances in Spatial and Temporal Databases
Algorithms for Performing Polygonal Map Overlay and Spatial Join on Massive Data Sets
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Algorithms for Reporting and Counting Geometric Intersections
IEEE Transactions on Computers
A fast planar partition algorithm. I
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
An optimal algorithm for intersecting line segments in the plane
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Range-aggregate query problems involving geometric aggregation operations
Nordic Journal of Computing
Algorithms for range-aggregate query problems involving geometric aggregation operations
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Hi-index | 0.02 |
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.