Image:Implicitmaxkdtree.gif

From Wikipedia, the free encyclopedia

[edit] Summary

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.

[edit] Licensing

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current12:33, 30 August 2007224×261 (34 KB)Genieser (Talk | contribs) (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)

The following pages on the English Wikipedia link to this file (pages on other projects are not listed):