Add to ORKGAbstract { Data-parallel algorithms for R-trees, a common spatial data structure arepresented, in the domain of planar line segment data (e.g., Bureau of the Census TIGER/Line les). Parallel algorithms for both building the data-parallel R-tree, as well as determining the closed polygons formed by the line segments, are described and implemented using the SAM (Scan-And-Monotonic-mapping) model of parallel computation on the hypercube architecture of the Connection Machine
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
The concept of a tree has been used in various areas of mathematics for over a century. In particula...
Region growing is a general technique for image segmentation, where image characteristics are used t...
Abstract { E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spati...
Data-parallel primitives for performing operations on the PM1 quadtree, bucket PMR quadtree, and R-t...
The segment tree is a simple and important data structure in computational geometry [7,11]. We prese...
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial ...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
k-d tree (or Multidimensional binary search tree) is often used as a data structure for organizing a...
[[abstract]]In this paper we introduce efficient parallel quadtree construction and manipulation alg...
Abstract: In this paper, we show that spatial joins are very suitable to be processed on a parallel ...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Several GIS applications are characterized by the vast amount of information that needs to be stored...
Many emerging mobile applications require analyzing large spatial datasets. In these applications, e...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
The concept of a tree has been used in various areas of mathematics for over a century. In particula...
Region growing is a general technique for image segmentation, where image characteristics are used t...
Abstract { E cient data-parallel spatial join algorithms for pmr quadtrees and R-trees, common spati...
Data-parallel primitives for performing operations on the PM1 quadtree, bucket PMR quadtree, and R-t...
The segment tree is a simple and important data structure in computational geometry [7,11]. We prese...
R-tree data structures are widely used in spatial databases to store, manage and manipulate spatial ...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
The tree-layout problem is to compute the coordinates of nodes of a tree so that the tree, when draw...
k-d tree (or Multidimensional binary search tree) is often used as a data structure for organizing a...
[[abstract]]In this paper we introduce efficient parallel quadtree construction and manipulation alg...
Abstract: In this paper, we show that spatial joins are very suitable to be processed on a parallel ...
[[abstract]]Appropriate concurrent operations can improve R-tree efficiency. Supporting concurrency ...
Several GIS applications are characterized by the vast amount of information that needs to be stored...
Many emerging mobile applications require analyzing large spatial datasets. In these applications, e...
This paper describes several parallel algorithms that solve geometric problems. The algorithms are b...
The concept of a tree has been used in various areas of mathematics for over a century. In particula...
Region growing is a general technique for image segmentation, where image characteristics are used t...