flâneur

LNCS 1879 - K-D Trees Are Better When Cut on the Longest Side

web.cs.ucdavis.edu · 5,943 words · saved by 1 readers

N/A

K-D Trees Are Better when Cut on the Longest Side Matthew Dickerson1 , Christian A. Duncan2 , and Michael T. Goodrich3 1 Dept. of Math & Comp. Sci., Middlebury College, Middlebury, VT 05753 dickerso@middlebury.edu 2 Algorithms & Complexity Group, Max-Planck-Inst. für Informatik, D-66123 Saarbrücken, Germany duncan@mpi-sb.mpg.de 3 Dept. of Comp. Sci., Johns Hopkins Univ., Baltimore, MD 21218 goodrich@jhu.edu Abstract. We…

saved by

related reading