Issue No. 02 - March/April (1993 vol. 13)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/38.204970
<p>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.</p>
F. Wang, "A Parallel Intersection Algorithm for Vector Polygon Overlay," in IEEE Computer Graphics and Applications, vol. 13, no. , pp. 74-81, 1993.