This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Parallel Intersection Algorithm for Vector Polygon Overlay
March/April 1993 (vol. 13 no. 2)
pp. 74-81

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.

1. D. White, "A Design for Polygon Overlay," inHarvard Papers on Geographic Information Systems, Laboratory for Computer Graphics and Spatial Analysis, Harvard, Cambridge, Mass., 1978-1979.
2. J.J. Little and T.K. Peucker, "A Recursive Procedure for Finding the Intersection of Two Digital Curves."Computer Graphics and Image Processing, Vol. 10, No. 2, June 1979, pp. 159-171.
3. J.A. Guevara,A Framework for the Analysis of Geographic Information System Procedure: The Polygon Overlay Problem, Computational Complexity and Polyline Intersection, doctoral dissertation. State University of New York at Buffalo, New York, 1983.
4. F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
5. W.R. Franklin et al., "Uniform Grids: A Technique for Intersection Detection on Serial and Parallel Machines."Proc. 9th Conf. Automated Cartography, American Society for Photogeometry and Remote Sensing. Falls Church. Va., 1989, pp. 100-109.
6. J. van Roessel, "A New Approach to Plane-Sweep Overlay: Topological Structuring and Line Segment Classification."Cartography and Geographic Information Systems, Vol. 18, No. 1, Jan. 1991, pp. 49-67.
7. K. Sugihara, "An Intersection Algorithm Based on Delaunay Triangulation."IEEE CG&A, Vol. 12, No. 2, Feb. 1992, pp. 59-67.
8. S. Brawer,Introduction to Parallel Programming, Academic Press, San Diego, Calif., 1989, pp. 69-102.
9. A. Osterhaug,Guide to Parallel Programming on Sequent Com puter Systems, Sequent Computer Systems, Beaverton, Ore., 1986.
10. T. Pavlidis,Algorithms for Graphics and Image Processing. Rockville, MD: Computer Science Press, 1982.

Citation:
Fangju Wang, "A Parallel Intersection Algorithm for Vector Polygon Overlay," IEEE Computer Graphics and Applications, vol. 13, no. 2, pp. 74-81, March-April 1993, doi:10.1109/38.204970
Usage of this product signifies your acceptance of the Terms of Use.