DOI: 10.3724/SP.J.1089.2010.11084

Journal of Computer-Aided Design & Computer Graphics (计算机辅助设计与图形学学报) 2010/22:9 PP.1529-1537

Segment Driven Feature-Sensitive Surface Reconstruction

In order to deal with point sets with sharp features or non-sufficient sampled points, this paper presents a segment driven feature-sensitive triangulation algorithm as an extension to general advancing front technique, to reconstruct high quality triangle meshes from unorganized, un-oriented point sets. With a smoothness threshold, the triangulation process is divided into two stages as segment reconstruction and stitching reconstruction. The segment reconstruction triangulates smooth regions starting from smooth seed triangulations, and by classifying elements and detecting features, filers out boundary outliers and relocate feature vertices in order to further advance fronts of these smooth segments. The stitching reconstruction stitches the gaps among segments or smooth regions of segments while advancing fronts of all segments, and relocates or inserts new feature vertices by intersections of local smooth surfaces. With this two-stage triangulation technique, the algorithm can robustly treat point sets with sharp features or bad sampling condition such as insufficient sampling, and especially avoids the expensive computation such as covariance analysis and intersection tests used in the general advancing front technique. Experiment results show that feature-sensitive quality triangulations can be achieved.

Key words:surface reconstruction,advancing front,sharp feature

ReleaseDate:2014-07-21 15:25:47

[1] Amenta N, Choi S, Dey T K,et al. A simple algorithm for homeomorphic surface reconstruction[C]// Proceedings of the 16th Annual Symposium on Computational Geometry. New York: ACM Press, 2000: 213-222

[2] Amenta N, Choi S, Kolluri R K. The power crust[C]// Proceedings of the 6th ACM Symposium on Solid Modeling and Applications. New York: ACM Press, 2001: 249-266

[3] Dey T K, Li K Y, Ramos E A,et al. Isotopic Reconstruction of Surfaces with Boundaries[J]. Computer Graphics Forum, 2009, 28(5): 1371-1382

[4] Hoppe H, Derose T, Duchamp T,et al. Surface reconstruction from unorganized points[C]// Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH. New York: ACM Press, 1992: 71-78

[5] Hoppe H, DeRose T, Duchamp T,et al. Piecewise smooth surface reconstruction[C]// Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH. New York: ACM Press, 1994: 295-302

[6] Ohtake Y, Belyaev A, Alexa M,et al. Multi-level partition of unity implicits[J]. ACM Transactions on Graphics, 2003, 22(3): 463-470

[7] Kazhdan M, Bolitho M, Hoppe H. Poisson surface reconstruction[C]// Proceedings of the 4th Eurographics Symposium on Geometry Processing. Aire-la-Ville: Eurographics Association, 2006: 67-71

[8] Kobbelt L P, Botsch M, Schwanecke U,et al. Feature sensitive surface extraction from volume data[C]// Computer Graphics Proceedings, Annual Conference Series, ACM SIGGRAPH. New York: ACM Press, 2001: 57-66

[9] Ju T, Losasso F, Schaefer S,et al. Dual contouring of Hermite data[J]. ACM Transactions on Graphic, 2002, 21(3): 339-346

[10] Oztireli A C,Guennebaud G, Gross M. Feature preserving point set surfaces based on non-linear kernel regression[J]. Computer Graphics Forum, 2009, 28(2): 493-501

[11] Huang J, Menq C H. Combinatorial manifold mesh reconstruction and optimization from unorganized points with arbitrary topology[J]. Computer-Aided Design, 2002, 34(2): 149-165

[12] Gopi M, Krishnan S, Silva C T. Surface reconstruction based on lower dimensional localized Delaunay triangulation[J]. Computer Graphics Forum, 2000, 19(3): 43-72

[13] Lin H W, Tai C L,Wang G J. A mesh reconstruction algorithm driven by an intrinsic property of a point cloud[J]. Computer-Aided Design, 2004, 36(1): 1-9

[14] Fleishman S, Cohen-Or D, Silva C T. Robust moving least-squares fitting with sharp features[J]. ACM Transactions on Graphics, 2005, 24(3): 544-552

[15] Li Gen, Chen Zhiyang, Zhang Sanyuan,et al. Mesh reconstruction algorithm based on neighborhood smoothness measure[J]. Journal of Computer-Aided Design & Computer Graphics, 2008, 20(4): 482-487 (in Chinese) (李 根, 陈志杨, 张三元, 等. 基于点邻域平坦度的网格重构算法[J]. 计算机辅助设计与图形学学报, 2008, 20(4): 482-487)

[16] Gumhold S, Wang X L, Macleod R. Feature extraction from point clouds[OL].

[17] Attene M, Falcidieno B, Rossignac J,et al. Sharpen&Bend: recovering curved sharp edges in triangle meshes produced by feature-insensitive sampling[J]. IEEE Transactions on Visualization and Computer Graphics, 2005, 11(2): 181-192

[18] Lévy B, Petitjean S, Ray N,et al. Least squares conformal maps for automatic texture atlas generation[J]. ACM Transactions on Graphics, 2002, 21(3): 362-371

[19] Pauly M, Gross M, Kobbelt L P. Efficient simplification of point-sampled surfaces[C]// Proceedings of the Conference on Visualization. Washington D C: IEEE Computer Society Press, 2002: 163-170