A Fast and Simple Surface Reconstruction Algorithm

2017 ◽  
Vol 13 (2) ◽  
pp. 1-30
Author(s):  
Siu-Wing Cheng ◽  
Jiongxin Jin ◽  
Man-Kit Lau
2007 ◽  
Author(s):  
Xingdou Fu ◽  
Pingjiang Wang ◽  
Xiaoqi Tang ◽  
Jihong Chen

Micromachines ◽  
2021 ◽  
Vol 12 (2) ◽  
pp. 164
Author(s):  
Dongxu Wu ◽  
Fusheng Liang ◽  
Chengwei Kang ◽  
Fengzhou Fang

Optical interferometry plays an important role in the topographical surface measurement and characterization in precision/ultra-precision manufacturing. An appropriate surface reconstruction algorithm is essential in obtaining accurate topography information from the digitized interferograms. However, the performance of a surface reconstruction algorithm in interferometric measurements is influenced by environmental disturbances and system noise. This paper presents a comparative analysis of three algorithms commonly used for coherence envelope detection in vertical scanning interferometry, including the centroid method, fast Fourier transform (FFT), and Hilbert transform (HT). Numerical analysis and experimental studies were carried out to evaluate the performance of different envelope detection algorithms in terms of measurement accuracy, speed, and noise resistance. Step height standards were measured using a developed interferometer and the step profiles were reconstructed by different algorithms. The results show that the centroid method has a higher measurement speed than the FFT and HT methods, but it can only provide acceptable measurement accuracy at a low noise level. The FFT and HT methods outperform the centroid method in terms of noise immunity and measurement accuracy. Even if the FFT and HT methods provide similar measurement accuracy, the HT method has a superior measurement speed compared to the FFT method.


2020 ◽  
Vol 57 (9) ◽  
pp. 090603
Author(s):  
张旭 Zhang Xu ◽  
侯茂盛 Hou Maosheng ◽  
刘智超 Liu Zhichao ◽  
刘涛 Liu Tao ◽  
李丽娟 Li Lijuan

2003 ◽  
Vol 3 (4) ◽  
pp. 302-307 ◽  
Author(s):  
Tamal K. Dey ◽  
Samrat Goswami

Surface reconstruction from unorganized sample points is an important problem in computer graphics, computer aided design, medical imaging and solid modeling. Recently a few algorithms have been developed that have theoretical guarantee of computing a topologically correct and geometrically close surface under certain condition on sampling density. Unfortunately, this sampling condition is not always met in practice due to noise, non-smoothness or simply due to inadequate sampling. This leads to undesired holes and other artifacts in the output surface. Certain CAD applications such as creating a prototype from a model boundary require a water-tight surface, i.e., no hole should be allowed in the surface. In this paper we describe a simple algorithm called Tight Cocone that works on an initial mesh generated by a popular surface reconstruction algorithm and fills up all holes to output a water-tight surface. In doing so, it does not introduce any extra points and produces a triangulated surface interpolating the input sample points. In support of our method we present experimental results with a number of difficult data sets.


Sign in / Sign up

Export Citation Format

Share Document