An Optimal and Practical Cache-Oblivious Algorithm for Computing Multiresolution Rasters

In many scientific applications it is required to reconstruct a raster dataset many times, each time using a different resolution. This leads to the following problem; let G be a raster of √ N × √ N cells. We want to compute for every integer 2 ≤ μ ≤ √ N a raster Gμ of d √ N/μe × d √ N/μe cells where each cell of Gμ stores the average of the values of… CONTINUE READING