Title :
A parallel intersection algorithm for vector polygon overlay
Author_Institution :
Dept. of Comput. Sci. & Inf. Sci., Guelph Univ., Ont., Canada
fDate :
3/1/1993 12:00:00 AM
Abstract :
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.<>
Keywords :
computational geometry; geographic information systems; parallel algorithms; composite network of polygons; intersection checking; parallel intersection algorithm; polygon density; vector geographic information systems; vector polygon overlay; Application software; Computer graphics; Data visualization; Geographic Information Systems; Parallel processing; Parallel programming; Partitioning algorithms; Performance analysis; Soil; Vegetation mapping;
Journal_Title :
Computer Graphics and Applications, IEEE
