Data-parallel polygonization

Authors:
Erik G. Hoel;Hanan Samet
Affiliations:
ESRI 380 New York Street Redlands, CA and Department of Computer Science, Institute of Advanced Computer Studies, Center for Automation Research, University of Maryland, College Park, MD;Department of Computer Science, Institute of Advanced Computer Studies, Center for Automation Research, University of Maryland, College Park, MD
Venue:
Parallel Computing - Special issue: High performance computing with geographical data
Year:
2003

Citing 26
Cited 2

A consistent hierarchical representation for vector data

SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
The BANG file: A new kind of grid file

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A population analysis for hierarchical data structures

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Scans as Primitive Parallel Operations

IEEE Transactions on Computers
Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures

The design and analysis of spatial data structures
The LSD tree: spatial access to multidimensional and non-point objects

VLDB '89 Proceedings of the 15th international conference on Very large data bases
Vector models for data-parallel computing

Vector models for data-parallel computing
The buddy tree: an efficient and robust access method for spatial data base

Proceedings of the sixteenth international conference on Very large databases
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Parallel R-trees

SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
LogP: towards a realistic model of parallel computation

PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
Parallel paradigms and practices for spatial data

Parallel paradigms and practices for spatial data
Special issue on data parallel algorithms and programming

Journal of Parallel and Distributed Computing - Special issue on data parallel algorithms and programming
A general solution of the n-dimensional B-tree problem

SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Storing a collection of polygons using quadtrees

ACM Transactions on Graphics (TOG)
The Grid File: An Adaptable, Symmetric Multikey File Structure

ACM Transactions on Database Systems (TODS)
Ubiquitous B-Tree

ACM Computing Surveys (CSUR)
Ultracomputers

ACM Transactions on Programming Languages and Systems (TOPLAS)
Fundamentals of Database Systems

Fundamentals of Database Systems
The K-D-B-tree: a search structure for large multidimensional dynamic indexes

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Proceedings of the 5th International Symposium on Advances in Spatial Databases

SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Proceedings of the 6th International Symposium on Advances in Spatial Databases

SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
Winged edge polyhedron representation.

Winged edge polyhedron representation.

A theoretical approach to the use of cyberinfrastructure in geographical analysis

International Journal of Geographical Information Science
Towards personal high-performance geospatial computing (HPC-G): perspectives and a case study

Proceedings of the ACM SIGSPATIAL International Workshop on High Performance and Distributed Geographic Information Systems

Quantified Score

Hi-index	0.00

Visualization

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.