Learn More
We modify the k-d tree on 0; 1] d by always cutting the longest edge instead of rotating through the coordinates. This modiication makes the expected time behavior of lower-dimensional partial match queries behave as for perfectly balanced complete k-d trees on n nodes. This is in contrast to a result of Flajolet and Puech, who proved that for (standard)(More)
  • 1