Abstract
In Reverse Engineering (RE), Point Cloud Data (PCD) processing is of great importance. But at present, a number of key issues about its algorithms are unresolved. This article mainly introduces the author who has done the research and put forward some specific algorithms on the aspects of data topology reconstruction, multi-view data registration and data reduction, and then developed a PCD processing system --3DPointshop, based on OpenGL and MFC. Through a series of instances of tests show that the prototype system which contains the algorithms and function modules will be able to implement on PCD processing well and could achieve the practical application level.
Publisher
Trans Tech Publications, Ltd.
Reference8 articles.
1. G. Goodsell: On finding p-th nearest neighbors of scattered points in two dimensions for small p Computer Aided Geometric Design, 17(4), 387–392 (2000).
2. Y. Hecker, R. Bolle: On geometric hashing and the generalized Hough transform. IEEE Transactions on Systems, Man and Cybernetics, 24(1), 1328–1338 (1994).
3. P. Besl and N. McKay: A method for registration of 3-D shapes. Trans. PAMI, 14(2), 239–255 (1992).
4. P. Cignoni, C. Montani and R. Scopigno: A comparison of mesh simplification algorithms. Computers & Graphics, 22(1), 37–54 (1998).
5. Bang-Shu Xiong, Ming-Yi He, Hua-Jing Yu: Algorithm for Finding k-Nearest Neighbors of Scattered Points in Three Dimensions. Journal of Computer-Aided Design & Computer Graphics, 16(7), 909–917 (2004). (in Chinese).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献