An Application of $M$-Ary Trees to the Design of Data Structures for Geometric Searching Problems
RAIRO - Theoretical Informatics and Applications - France
doi 10.1051/ita/1989230201651
Full Text
Open PDFAbstract
Available in full text
Date
January 1, 1989
Authors
Publisher
EDP Sciences