An application of $m$-ary trees to the design of data structures for geometric searching problems
and
RAIRO-Theor. Inf. Appl., 23 2 (1989) 165-176
Published online: 01 February 2017
DOI: 10.1051/ita/1989230201651