English: Construction and storage of a 2D implicit max-kd-tree using the grid median splitting-function. Each cell of the rectilinear grid has one scalar value from low (bright blue) to high (bright red) assigned to it. The grid's memory footprint is indicated in the lower line. The implicit max-kd-tree's predefined memory footprint needs one scalar value less than that. The storing of the node's max values is indicated in the upper line.
This work has been released into the public domain by its author, Genieser. This applies worldwide.
In some countries this may not be legally possible; if so: Genieser grants anyone the right to use this work for any purpose, without any conditions, unless such conditions are required by law.
Construction and storage of a 2D implicit max-''k''d-tree using the grid median splitting-function. Each cell of the rectilinear grid has one scalar value from low (bright blue) to high (bright red) assigned to it. The grid's memory footprint is indicated
Captions
Add a one-line explanation of what this file represents