Algorithm for Generation of Adaptive Tiles
Original Publication Date: 2004-Dec-14
Included in the Prior Art Database: 2004-Dec-14
A method for partitioning the N-dimensional parallelepiped region (e.g., a rectangle in two dimensions) into disjoint sub-parallelepipeds, or tiles, which completely cover it is disclosed. The method takes as input a number of values at different points within the region which represent samples of some parameter which varies continuously within the region. The method can be used to generate tiles within which the range of sample values is less than some specified bound, to partition the original region into a specified maximum number of tiles, and/or to include specified parallelepipeds in the output tile list.