Special Issue on Data Parallel Algorithms and Programming - Guest Editors' Introduction

Open Webpage

Joseph F. JáJá, Pearl Y. Wang

Published: 1994, Last Modified: 15 May 2025J. Parallel Distributed Comput. 1994EveryoneRevisionsBibTeXCC BY-SA 4.0
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.