Novel algorithms for 3D surface point cloud boundary detection and edge reconstruction

被引:61
作者
Mineo, Carmelo [1 ]
Pierce, Stephen Gareth [1 ]
Summan, Rahul [1 ]
机构
[1] Univ Strathclyde, Dept Elect & Elect Engn, Royal Coll Bldg,204 George St, Glasgow G1 1XW, Lanark, Scotland
基金
英国工程与自然科学研究理事会;
关键词
Point-cloud; Boundary detection; Edge reconstruction;
D O I
10.1016/j.jcde.2018.02.001
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Tessellated surfaces generated from point clouds typically show inaccurate and jagged boundaries. This can lead to tolerance errors and problems such as machine judder if the model is used for ongoing manufacturing applications. This paper introduces a novel boundary point detection algorithm and spatial FFT-based filtering approach, which together allow for direct generation of low noise tessellated surfaces from point cloud data, which are not based on pre-defined threshold values. Existing detection techniques are optimized to detect points belonging to sharp edges and creases. The new algorithm is targeted at the detection of boundary points and it is able to do this better than the existing methods. The FFT-based edge reconstruction eliminates the problem of defining a specific polynomial function order for optimum polynomial curve fitting. The algorithms were tested to analyse the results and measure the execution time for point clouds generated from laser scanned measurements on a turbofan engine turbine blade with varying numbers of member points. The reconstructed edges fit the boundary points with an improvement factor of 4.7 over a standard polynomial fitting approach. Furthermore, through adding artificial noise it has been demonstrated that the detection algorithm is very robust for out-of-plane noise lower than 25% of the cloud resolution and it can produce satisfactory results when the noise is lower than 75%. (C) 2018 Society for Computational Design and Engineering. Publishing Services by Elsevier.
引用
收藏
页码:81 / 91
页数:11
相关论文
共 30 条
[1]  
[Anonymous], 2015, P INT C DIG IM COMP
[2]  
[Anonymous], METHODS EXPT PHYS SP
[3]  
[Anonymous], 1934, IZV AKAD NAUK SSSR O
[4]  
[Anonymous], 1995, P 1 INT COMP GEOM SO
[5]  
[Anonymous], HDB DISCRETE COMPUTA
[6]  
Arlinghaus S. L., 1994, Practical handbook of curve fitting
[7]   The Quickhull algorithm for convex hulls [J].
Barber, CB ;
Dobkin, DP ;
Huhdanpaa, H .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04) :469-483
[8]   A Survey of Surface Reconstruction from Point Clouds [J].
Berger, Matthew ;
Tagliasacchi, Andrea ;
Seversky, Lee M. ;
Alliez, Pierre ;
Guennebaud, Gael ;
Levine, Joshua A. ;
Sharf, Andrei ;
Silva, Claudio T. .
COMPUTER GRAPHICS FORUM, 2017, 36 (01) :301-329
[9]  
Biggs N., 1979, HIST MATH, V6, P109, DOI [10.1016/0315-0860(79)90074-0, DOI 10.1016/0315-0860(79)90074-0]
[10]   SSD: Smooth Signed Distance Surface Reconstruction [J].
Calakli, F. ;
Taubin, G. .
COMPUTER GRAPHICS FORUM, 2011, 30 (07) :1993-2002