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.
Ovo delo je njen nosilac autorskih prava Genieser predao u javno vlasništvo. Ovo se odnosi na ceo svet.
U nekim zemljama, ovo nije zakonski moguće; u tom slučaju: Genieser tvorac ovog dela dozvoljava svakome da koristi ovo delo za bilo koju namenu, bez bilo kakvih uslova, osim uslova koje nameće zakon.
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
Natpisi
Dodajte objašnjenje u jednom redu o tome šta ova datoteka predstavlja