K-D Trees Are Better when Cut on the Longest Side

Algorithms - ESA 2000 - Lecture Notes in Computer Science ◽

10.1007/3-540-45253-2_17 ◽

2000 ◽

pp. 179-190 ◽

Cited By ~ 3

Author(s):

Matthew Dickerson ◽

Christian A. Duncan ◽

Michael T. Goodrich

Get full-text (via PubEx)