Computational geometry: an introduction
Computational geometry: an introduction
Guide to parallel programming on Sequent computer systems: 2nd edition
Guide to parallel programming on Sequent computer systems: 2nd edition
Introduction to parallel programming
Introduction to parallel programming
Algorithms for Graphics and Imag
Algorithms for Graphics and Imag
An Intersection Algorithm Based on Delaunay Triangulation
IEEE Computer Graphics and Applications
A framework for the analysis of geographic information system procedures: the polygon overlay problem, computational complexity and polyline intersection
Declustering and Load-Balancing Methods for Parallelizing Geographic Information Systems
IEEE Transactions on Knowledge and Data Engineering
Proceedings of the 2nd ACM SIGSPATIAL International Workshop on Analytics for Big Geospatial Data
| Hi-index | 0.00 |
A parallel intersection algorithm for speeding the creation of a composite network of polygons whose identities relate to the original polygons from which they are formed in vector geographic information systems (ISs) is described. The algorithm reduces unnecessary intersection checking, especially when polygon density is high. Single-stream and multiple-stream versions of the algorithm are discussed. Experimental results illustrating the overall performance of the parallel algorithm are presented.