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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Parallel computing Jg. 29; H. 10; S. 1381 - 1401
Hauptverfasser: Hoel, Erik G., Samet, Hanan
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Elsevier B.V 01.10.2003
Schlagworte:
Data-parallel algorithms
Hierarchical spatial data structures
Lines
Polygonization
Hierarchical spatial data structures
Data-parallel algorithms
Polygonization
Lines
ISSN:0167-8191, 1872-7336
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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