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

Full description

Saved in:

Bibliographic Details
Published in:	Parallel computing Vol. 29; no. 10; pp. 1381 - 1401
Main Authors:	Hoel, Erik G., Samet, Hanan
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2003
Subjects:	Data-parallel algorithms Hierarchical spatial data structures Lines Polygonization Hierarchical spatial data structures Data-parallel algorithms Polygonization Lines
ISSN:	0167-8191, 1872-7336
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	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.
ISSN:	0167-8191 1872-7336
DOI:	10.1016/j.parco.2003.05.001