%0 Journal Article %J Parallel Computing %D 2003 %T Data-parallel polygonization %A Hoel,Erik G. %A Samet, Hanan %K Data-parallel algorithms %K Hierarchical spatial data structures %K Lines %K Polygonization %X Data-parallel algorithms are presented for polygonizing a collection of line segments represented by a data-parallel bucket PMR quadtree, a data-parallel R-tree, and a data-parallel R+-tree. Such an operation is useful in a geographic information system (GIS). A sample performance comparison of the three data-parallel structures for this operation is also given. %B Parallel Computing %V 29 %P 1381 - 1401 %8 2003/10// %@ 0167-8191 %G eng %U http://www.sciencedirect.com/science/article/pii/S0167819103001091 %N 10 %R 10.1016/j.parco.2003.05.001