Data-parallel polygonization
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. (C) 2003 Published by Elsevier B.V.
polygonization data-parallel algorithms lines hierarchical spatial data structures