@article {16893, title = {Data-parallel polygonization}, journal = {Parallel Computing}, volume = {29}, year = {2003}, month = {2003/10//}, pages = {1381 - 1401}, abstract = {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.}, keywords = {Data-parallel algorithms, Hierarchical spatial data structures, Lines, Polygonization}, isbn = {0167-8191}, doi = {10.1016/j.parco.2003.05.001}, url = {http://www.sciencedirect.com/science/article/pii/S0167819103001091}, author = {Hoel,Erik G. and Samet, Hanan} }