An implicit surface polygonizer
Graphics gems IV
Piecewise smooth surface reconstruction
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
A dynamic integration algorithm to model surfaces from multiple range views
Machine Vision and Applications
A General Surface Approach to the Integration of a Set of Range Views
IEEE Transactions on Pattern Analysis and Machine Intelligence
The approximation power of moving least-squares
Mathematics of Computation
Using Spin Images for Efficient Object Recognition in Cluttered 3D Scenes
IEEE Transactions on Pattern Analysis and Machine Intelligence
An optimal algorithm for approximate nearest neighbor searching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the conference on Visualization '01
Reliable Surface Reconstructiuon from Multiple Range Images
ECCV '96 Proceedings of the 4th European Conference on Computer Vision-Volume I - Volume I
Accurate integration of multi-view range images using k-means clustering
Pattern Recognition
| Hi-index | 0.00 |
Three-dimensional (3D) data processing and modeling from range images plays an important role in many applications. Since overlap elimination of registered range images is a necessary step in 3D object modeling, many research efforts have been made. In this paper, a novel approach for eliminating overlaps of a registered data set is proposed. Firstly, the input data (registered range images) which contain overlaps is represented by a bd-tree data structure. Then, Moving Least Squares (MLS) and Spin Map (SM) together with the nearest neighbor searching are used to identify and eliminate the overlaps. The method manipulates the registered images directly without meshing them first, therefore, provides a straightforward way to remove redundant data, which makes it different from the conventional methods. The experimental results demonstrate the efficiency of the proposed algorithm.