TEMPLATE DESIGN © We presented a simple and effective orienter for defective raw point sets. By seamlessly combining the Laplacian contraction and visibility voting, our approach tackles the problem without resorting to any complicated data structures and advanced solvers. As a global approach, our method is able to handle noise, non- uniformities, sparsity and thin sharp features. Thus it helps to improve the quality of reconstructed surfaces via conventional reconstruction schemes from defect- ridden point sets. Our approach can also deal with point sets with holes and open boundaries, which pose a challenge for most orienters possessing the aid of voxelization. We demonstrated the efficacy of our method through numerous experiments. Compute orientation indication vector by contracting point set P=(X, N in ) a bit to a shrunk point set S=(X’, N in ). N in is estimated by local PCA. Choice of neighbors: KNN + tangential-direction-favored normal propagation scheme[1] Choice of Laplacian: combinational Laplacian Orienting Raw Point Sets by Global Contraction and Visibility Voting School of Mathematical Sciences, Dalian University of Technology, Dalian, China School of Computer Engineering, Nanyang Technological University, Singapore MOTIVATION 1.Orientation benefits surface reconstruction. 2.Existing orienters are limited by the local property. Tagging confidence by visibility checking ORIENTING GLOBALLY BY CONFIDENCE-WEIGHTED SMOOTHING OUTLINE c d b THE RESULTS Figure 1. Orientation results of the non-uniformly distributed point clouds of Venus model (see (a) 72.5 K) via different approaches. (b) Cons: the point clouds consolidation approach [9]. (c) ORT: the adaptive spherical cover approach [14]. (d) BOT: the binary orientation tree [4]. (e) Our approach by constrained Laplacian smoothing and visibility voting. The back- facing points are rendered in black splats. CONTRACTING Contraction constraint Attraction constraint (a) Input (b) Cons (c) ORT (d) BOT (e) Ours References [1] Huang H, Li D, Zhang H, Ascher U, Cohen-Or D. Consolidation of unorganized point clouds for surface reconstruction. ACM Transactions on Graphics 2009;28(5). [2] Liu S, Wang CCL. Orienting unorganized points for surface reconstruction. Computers & Graphics 2010;34(3). [3] Chen Y-L, Chen B-Y, Lai S-H, Nishita T. Binary orientation trees for volume and surface reconstruction from unoriented point clouds. Computer Graphics Forum 2010;29(7). NSFC (No. U & No ) NRF2008IDM-IDM & AcRF 69/07 Acknowledgements Figure 2. (a) Input model with estimated normals. (b) The input points (orange) and shrunk points (green). (c) Initial orientation estimation by visibility checking. (d) Orientation after the visibility confidence weighted smoothing (locally inconsistent orientations are highlighted in red rectangles). (e) Consistent orientation after the majority-determined confidence weighted smoothing. Conclusions We assign each v i a visibility confidence c i (set to 0 firstly) by checking the visibility of P and S from multi-viewpoints by the hidden point removal (HPR) operator: Figure 3. The more viewpoints are used, the more qualified confidences will we obtain. Empirically, we choose 14 viewpoints distributed uniformly on the surface of the bounding box. Cons ORT BOT Ours Cons ORT Ours THE RESULTS Figure 4. Orientations of point sets with thin sharp features and nearby surface sheets. Figure 5. Orientations of point sets with open boundaries. Figure 6. Orientations of Dinosaur and Horse models with non-uniformities and sparsity. Figure 7. Robust to noise. The top row shows three noisy models (0.5%, 1% and 3%). The middle and bottom rows are the corresponding Poisson reconstruction via orientation by the ORT orienter and our approach. Cons ORT BOT Ours Figure 8. Orientation benefits reconstruction. Top row: the orientation of various point clouds by our approach; Bottom row: the reconstructed meshes of BRF method by using our orientation results.