Technical SectionOrienting unorganized points for surface reconstruction
Introduction
The reverse engineering problem for reconstructing three dimensional models in a computer system from unorganized points that are generated by 3D surface scanning devices has been a subject of intensive research for many years. The scanned 3D surface represented by an unorganized point cloud is typically noisy, contains holes, and has high variations in point density. Oriented normals at the points play a critical role in surface reconstruction. It is because that the oriented normals define the reconstructed surface to the first order and identify the inside/outside information. As will be shown in our tests below, the oriented normals become extremely important at the regions with very sparse points. Also, to generate correctly oriented normal vectors on the points in such regions is a very tough job. The conventional methods using minimal spanning tree (MST) (e.g., [1]) or Voronoi diagram (e.g., [2], [3], [4]) fail. Some recent researches consider estimating normals from captured images using photometric stereo [5], [6], which however suffers from the unideal acquisition conditions like specular reflections, material artifacts, and shadowing. The most recent work presented in [7] does not assign normal vectors directly to the given points. It first adopts a weighted locally optimal projection operator to produce a set of denoised and evenly distributed particles over the original point cloud, and then conducts a priority-driven normal propagation scheme to assign normal vectors to the particles. This down-sampling strategy actually further removes limited information of underlying surfaces from those highly sparse regions, therefore the reconstructed surface in such regions will not be as good as ours (see Fig. 1). Our approach proposed in this paper can assign consistently oriented normal vectors to the scattered points so that the downstream reconstruction algorithm can successfully generate surface in the regions with highly sparse points.
To orient unorganized points effectively and efficiently, we develop two techniques by extending the integrating approach for meshing scattered point data [8]. First, a modified scheme is proposed to generate adaptive spherical cover (ASC) for unorganized points by adding an eigenvalue analysis based sphere splitting step. With this step, our approach can better preserve the surface's connectivity in the regions with highly sparse points. After getting the spherical cover for scattered points, the triangulation and topology cleaning procedure [8] can generate a triangular mesh surface M roughly presenting the underlying surface S. Although this mesh M is not a good approximation of S, it gives a very robust evidence for assigning the orientation of input points. A straightforward way is to find the closest point cp on M for each input point p, then the normal vector of cp on M is assigned as the normal vector of p. Nevertheless, as M is an inaccurate approximation of S, such normal vectors give inaccurate surface information to the downstream mesh reconstruction algorithm (e.g., [9]). Therefore, instead of assigning to p, we only let p hold the orientation of ncp—thus, we name our method as orienting approach (ORT). An orientation-aware principle component analysis (PCA) step is adopted to assign correct and consistently oriented normal vectors to the unorganized points. Moreover, the ASC constructed in the first step will be employed to speed up the closest point search on M. The experimental results demonstrate that our approach can successfully orient the unorganized point clouds for various models—so that conventional schemes like [9] can reconstruct a proper surface for the input data. Fig. 1 shows a comparison of the results between other approaches and ours on a Venus head model with non-uniform point density and noises. Our approach (ORT+RBF) gives the best reconstruction result. The good performance of our approach is benefited by (1) the proposed framework of using adaptive ASC to give the consistent orientation of points and (2) the newly developed sphere splitting step based on eigenvalue analysis.
Section snippets
Related work
The existing work in the literature can be classified into two major groups: (1) computational geometry approaches and (2) volumetric reconstruction techniques, which will be reviewed below.
The computational geometry approaches are usually based on the Voronoi diagram of a given point cloud and reconstruct a mesh surface by directly linking the input samples. Normal information is not required. Amenta et al. [2] gave a provable guarantee of reconstructing a correct model given a minimum
Modified adaptive spherical cover
The adaptive spherical cover (ASC) generated in [8] works well on a noisy point cloud S={p1, …, pn} with n scattered points, and outputs a set of covering spheres which will be employed to construct triangular meshes by linking the auxiliary points in the spheres. To compensate the variation of point density on S, every point is assigned with a weightwhere are the k-nearest neighbors of pi. We select k=10 in all our experimental tests, which well balances the speed
Orienting unorganized points
After triangulating the auxiliary points in the modified adaptive spherical cover into a triangular mesh and cleaning its topology, we obtain a rough mesh surface M for approximating the underlying surface, which is represented by the input scattered data point S. Although M does not accurately approximate the shape of the underlying surface H, it gives a very good estimation of H's topology. Therefore, very good estimation of the orientation on H for the points in S can be found from M.
Results
The proposed approach has been implemented in Visual C++. Our implementation has been tested on a variety of models. The statistics in this paper are all tested on a standard PC with Intel Core 2 CPU 6600 at 2.4 GHz plus 2.0 GB RAM.
The first example tested is the Venus head model with noises and non-uniform sparseness, which is shown in Fig. 1. Note that making the density of points much farther sparse may lead our method also failed, so as others. Our method gives better result than other
Conclusion and discussion
In this paper, we have presented a robust and efficient method to assign consistently oriented normal vectors to unorganized points with noises, non-uniformities, and thin sharp features as a pre-processing step to surface reconstruction. The conventional method for this normal assignment step is through the minimal spanning tree based normal propagation, which however is not robust on the unorganized points with noises, non-uniformities, and thin sharp features. The newly developed point
Acknowledgements
The authors would like to thank the authors of [7] for sharing the executable program of their approach. This research is supported by the HKSAR Research Grants Council GRF Grant (Ref.: CUHK/417109), and the Shun Hing Institute of Advanced Engineering (SHIAE) Research Grant (Ref.: CUHK/8115022). The first author is also partially supported by the Open Project Program of the State Key Lab of CAD&CG (Grant no. A0805), Zhejiang University.
References (23)
- et al.
Examining the uncertainty of the recovered surface normal in three light photometric stereo
Image and Vision Computing
(2007) - et al.
3D scattered data interpolation and approximation with multilevel compactly supported RBFs
Graphical Models
(2005) - Hoppe H, DeRose T, Duchamp T, McDonald J, Stuetzle W. Surface reconstruction from unorganized points. In: Proceedings...
- Amenta N, Bern M, Kamvysselis M. A new voronoi-based surface reconstruction algorithm. In: Proceedings of ACM SIGGRAPH...
- Amenta N, Choi S, Kolluri R. The power crust. In: Proceedings of 6th ACM symposium on solid modeling, 2001. p....
- Dey TK, Goswami S. Tight cocone: a water-tight surface reconstructor. In: Proceedings of the 8th ACM symposium solid...
- Ma W-C, Hawkins T, Peers P, Chabert C-F, Weiss M, Debevec P. Rapid acquisition of specular and diffuse normal maps from...
- Huang H, Li D, Zhang H, Ascher U, Cohen-Or D. Consolidation of unorganized point clouds for surface reconstruction. In:...
- Ohtake Y, Belyaev A, Seidel H-P. An integrating approach to meshing scattered point data. In: Proceedings of ACM...
- Mederos B, Amenta N, Velho L, de Figueiredo LH. Surface reconstruction from noisy point clouds. In: SGP 05: Proceedings...
Cited by (40)
Deep Patch-based Global Normal Orientation
2022, CAD Computer Aided DesignCitation Excerpt :The first step of these methods is to estimate the unoriented normals using OBNE [27] or HoughCNN [42]. Their second step is to align the unoriented normals consistently by MMSTV [27] or MRFO [45]. The rest methods are one-step deep orienters, of which the network models are trained on ModelNet40 and evaluated on ModelNet40 and SHREC15.
Towards globally optimal normal orientations for thin surfaces
2018, Computers and Graphics (Pergamon)Citation Excerpt :These methods are also based on the assumption of spatial coherence of normal vectors. Liu et al. [23] connect the point cloud into a triangle mesh and generate the normal orientations from the resulting mesh. Cao et al. [7] combine the constrained Laplacian smoothing technique and the hidden point removal technique to compute the normal orientations.
A closed-form formulation of HRBF-based surface reconstruction by approximate solution
2016, CAD Computer Aided DesignCitation Excerpt :To overcome the last limitation, an optional step can be applied to select a subset of input points to serve as the centers of kernels to obtain a better surface reconstruction (see the illustration shown in Fig. 12). A method akin to the spherical covering method proposed in prior work [42] is used here, and more details can be found in [39]. An alternative is the adaptive center selection method employed in [43].
Fast and efficient narrow volume reconstruction from scattered data
2015, Pattern RecognitionMendable consistent orientation of point clouds
2014, CAD Computer Aided DesignCitation Excerpt :Consistently oriented normals are critical for surface reconstruction. The state-of-the-art reconstruction algorithms [1,9,2,10] may produce poor quality results without consistent orientation [11,12]. Although some advanced 3D scanning devices are capable of generating some additional properties, such as color and normal, when acquiring point positions, more general digitizing devices and computer vision algorithms do not provide such properties.
Point Cloud Reconstruction and Body Size Measurement of a Contactless Pig Body
2023, Proceedings - 2023 2nd International Conference on Machine Learning, Cloud Computing, and Intelligent Mining, MLCCIM 2023