Special Issue on Data Parallel Algorithms and Programming - Guest Editors' Introduction
Lists
Only you see this
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.
BibTeX
@article{jaja1994special,
author = {Joseph F. JáJá and Pearl Y. Wang},
title = {{Special Issue on Data Parallel Algorithms and Programming - Guest Editors' Introduction}},
journal = {J. Parallel Distributed Comput.},
year = {1994},
url = {https://openreview.net/forum?id=COnTXwJOFs},
}Loading related content...