SpatialHadoop is an extended MapReduce framework that supports global indexing that spatial partitions the data across machines providing orders of magnitude speedup, compared to traditional Hadoop. In this paper, we describe seven alternative partitioning techniques and experimentally study their effect on the quality of the generated index and the performance of range and spatial join queries...

Grid computing allows the usage of distributed resources possibly belonging to different institutions in a transparent way. This paper presents InteGrade, an object-oriented Grid tool that focuses on leveraging the idle computing power of shared desktop machines. Moreover, it currently allows the execution of sequential, parametric, and BSP parallel applications.

We present a new partitioning algorithm for grids obtained by adaptive reenement. The method uses the adaptive reenement tree to obtain information unavailable to other partitioning methods which use only the nal grid and/or some geometric data. The algorithm requires (typically) O(log(N)) operations after an O(N) preprocessing step. The method is guaranteed to produce perfectly balanced connec...

This paper presents a study of image simplification techniques as a first stage to define a multiresolution registration framework. We propose here a new approach for image registration based on the partitioning of the source images in binary-space (BSP) and quad-tree structures. These partitioned images have been obtained with a maximum mutual information gain algorithm. Multimodal registratio...

Let an edge cut partition the vertex set of an n-dimensional quadratic grid with the side length a into k subsets A1, ..., Ak with ||Ai| − |Aj || ≤ 1. We consider the problem of determining the minimal size c(n, k, a) of such a cut and present its asymptotic c(n, k, a) ∼ nan−1 n √ k as a, k →∞ and k/an → 0. The same asymptotic holds for partitioning of the n-dimensional torus. We present also s...

We present a new approach for the parallel adaption of multigrids on distributed memory architectures. It is based on a simple, object-oriented data structure employing arrays rather than the more customary linked lists. The particular problem of dynamic load balancing is solved using an innovative recursive partitioning strategy. Large-scale computations on a Cray T3E system using up to 512 pr...

We propose an efficient, accurate method to integrate the basins of attraction of a smooth function defined on a general discrete grid and apply it to the Bader charge partitioning for the electron charge density. Starting with the evolution of trajectories in space following the gradient of charge density, we derive an expression for the fraction of space neighboring each grid point that flows...

This paper describes the methods that can be used to detect building objects under the circumstances of high object density and scene complexity seen in 1-metre high resolution satellite imagery. In order to reduce the building hypothesis space in early processes, a local Fourier analysis does an analysis of the dominant orientation angle in a building cluster. This serves to extract the focuse...

We present an implementation of a finite-difference approximation for the solution of partial differential equations on transputer networks. The grid structure associated with the finite-difference approximation is exploited by using geometric partitioning of the data among the processors. This provides a very low degree of communication between the processors. The resultant system of linear eq...