Strukture podataka za efikasno prebrojavanje nad skupovima tačaka
Nastava matematike, LVIII (2013) no. 1-2, p. 40
Cet article a éte moissonné depuis la source eLibrary of Mathematical Institute of the Serbian Academy of Sciences and Arts
$k$-d tree and $R$-tree methods for enumeration of point sets are presented.
Classification :
1AMS97N60 2MESCN64
Keywords: Data structure, enumeration of point sets, k-d tree, R-tree.
Keywords: Data structure, enumeration of point sets, k-d tree, R-tree.
@article{NM_2013_LVIII_1-2_a4,
author = {Dragan Uro\v{s}evi\'c},
title = {Strukture podataka za efikasno prebrojavanje nad skupovima ta\v{c}aka},
journal = {Nastava matematike},
pages = {40 },
year = {2013},
volume = {LVIII},
number = {1-2},
language = {en},
url = {http://geodesic.mathdoc.fr/item/NM_2013_LVIII_1-2_a4/}
}
Dragan Urošević. Strukture podataka za efikasno prebrojavanje nad skupovima tačaka. Nastava matematike, LVIII (2013) no. 1-2, p. 40 . http://geodesic.mathdoc.fr/item/NM_2013_LVIII_1-2_a4/