We modify the k-d tree on [0, 1]d by always cutting the longest edge instead of rotating through the coordinates. This modification makes the expected time behavior of lowerdimensi...
The ICP (Iterative Closest Point) algorithm is the de facto standard for geometric alignment of threedimensional models when an initial relative pose estimate is available. The ba...
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...