The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...
In orthogonal range reporting we are to preprocess N points in d-dimensional space so that the points inside a d-dimensional axis-aligned query box can be reported efficiently. T...
—Most research works focus on pattern recognition within a small sample images but strategies for running efficiently these algorithms over large images are rarely if ever speci...
Antoine Veillard, Nicolas Lomenie, Daniel Racocean...
This paper investigates the design of parallel algorithmic strategies that address the efficient use of both, memory hierarchies within each processor and a multilevel clustered ...
Frank K. H. A. Dehne, Stefano Mardegan, Andrea Pie...
In computational simulation of coupled, multicomponent systems, it is frequently necessary to transfer data between meshes that may di er in resolution, structure, and discretizat...
Xiangmin Jiao, Herbert Edelsbrunner, Michael T. He...