The time complexity of the algorithm described above is dominated by the time for determining the closest points (brute force search for 3D scans of points). Several enhancements have been proposed [6,7,24]. We have implemented d-trees as proposed by Simon et al. Fig. shows two slices taken from a d-tree.