A geometric approach to the segmentation of range images

We present a novel geometric approach to extract planes from sets of 3D points. For a set with n points the algorithm has an O(n/sup 3/ log n) time complexity. We also discuss an implementation of the algorithm for range image segmentation. The performance of the new range image segmentation algorithm is compared to other existing methods.