By Topic

A parallel intersection algorithm for vector polygon overlay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fangju Wang ; Dept. of Comput. Sci. & Inf. Sci., Guelph Univ., Ont., Canada

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.<>

Published in:

Computer Graphics and Applications, IEEE  (Volume:13 ,  Issue: 2 )