Discover the SciOpen Platform and Achieve Your Research Goals with Ease.
Search articles, authors, keywords, DOl and etc.
Feature-preserving mesh reconstruction from point clouds is challenging. Implicit methods tend to fit smooth surfaces and cannot be used to reconstruct sharp features. Explicit reconstruction methods are sensitive to noise and only interpolate sharp features when points are distributed on feature lines. We propose a watertight surface reconstruction method based on optimal transport that can accurately reconstruct sharp features often present in CAD models. We formalize the surface reconstruction problem by minimizing the optimal transport cost between the point cloud and the reconstructed surface. The algorithm consists of initialization and refinement steps. In the initialization step, the convex hull of the point cloud is deformed under the guidance of a transport plan to obtain an initial approximate surface. Next, the mesh surface was optimized using operations including vertex relocation and edge collapses/flips to obtain feature-preserving results. Experiments demonstrate that our method can preserve sharp features while being robust to noise and missing data.
Berger, M.; Tagliasacchi, A.; Seversky, L. M.; Alliez, P.; Guennebaud, G.; Levine, J. A.; Sharf, A.; Silva, C. T. A survey of surface reconstruction from point clouds. Computer Graphics Forum Vol. 36, No. 1, 301–329, 2017.
Cohen-Steiner, D.; Da, F. A greedy Delaunay-based surface reconstruction algorithm. The Visual Computer Vol. 20, No. 1, 4–16, 2004.
Bernardini, F.; Mittleman, J.; Rushmeier, H.; Silva, C.; Taubin, G. The ball-pivoting algorithm for surface reconstruction. IEEE Transactions on Visualization and Computer Graphics Vol. 5, No. 4, 349–359, 1999.
Digne, J.; Morel, J. M.; Souzani, C. M.; Lartigue, C. Scale space meshing of raw data point sets. Computer Graphics Forum Vol. 30, No. 6, 1630–1642, 2011.
Chen, Z.; Zhang, T.; Cao, J.; Zhang, Y. J.; Wang, C. Point cloud resampling using centroidal Voronoi tessellation methods. Computer-Aided Design Vol. 102, 12–21, 2018.
Kazhdan, M.; Hoppe, H. Screened Poisson surface reconstruction. ACM Transactions on Graphics Vol. 32, No. 3, Article No. 29, 2013.
Hou, F.; Wang, C.; Wang, W.; Qin, H.; Qian, C.; He, Y. Iterative Poisson surface reconstruction (iPSR) for unoriented points. ACM Transactions on Graphics Vol. 41, No. 4, Article No. 128, 2022.
Sharf, A.; Lewiner, T.; Shamir, A.; Kobbelt, L.; Cohen-Or, D. Competing fronts for coarse-to-fine surface reconstruction. Computer Graphics Forum Vol. 25, No. 3, 389–398, 2006.
Lu, W.; Liu, L. Surface reconstruction via cooperative evolutions. Computer Aided Geometric Design Vol. 77, Article No. 101831, 2020.
Hanocka, R.; Metzer, G.; Giryes, R.; Cohen-Or, D. Point2Mesh: A self-prior for deformable meshes. ACM Transactions on Graphics Vol. 39, No. 4, Article No. 126, 2020.
Wang, P.; Wang, Z.; Xin, S.; Gao, X.; Wang, W.; Tu, C. Restricted delaunay triangulation for explicit surface reconstruction. ACM Transactions on Graphics Vol. 41, No. 5, Article No. 180, 2022.
Hanocka, R.; Hertz, A.; Fish, N.; Giryes, R.; Fleishman, S.; Cohen-Or, D. MeshCNN: A network with an edge. ACM Transactions on Graphics Vol. 38, No. 4, Article No. 90, 2019.
Öztireli, A. C.; Guennebaud, G.; Gross, M. Feature preserving point set surfaces based on non-linear kernel regression. Computer Graphics Forum Vol. 28, No. 2, 493–501, 2009.
Avron, H.; Sharf, A.; Greif, C.; Cohen-Or, D. ℓ1-Sparse reconstruction of sharp point set surfaces. ACM Transactions on Graphics Vol. 29, No. 5, Article No. 135, 2010.
Huang, H.; Wu, S.; Gong, M.; Cohen-Or, D.; Ascher, U.; Zhang, H. R. Edge-aware point set resampling. ACM Transactions on Graphics Vol. 32, No. 1, Article No. 9, 2013.
Digne, J.; Cohen-Steiner, D.; Alliez, P.; de Goes, F.; Desbrun, M. Feature-preserving surface reconstruction and simplification from defect-laden point sets. Journal of Mathematical Imaging and Vision Vol. 48, No. 2, 369–382, 2014.
Dey, T. K.; Ge, X.; Que, Q.; Safa, I.; Wang, L.; Wang, Y. Feature-preserving reconstruction of singular surfaces. Computer Graphics Forum Vol. 31, No. 5, 1787–1796, 2012.
Xu, R.; Wang, Z.; Dou, Z.; Zong, C.; Xin, S.; Jiang, M.; Ju, T.; Tu, C. RFEPS: Reconstructing feature-line equipped polygonal surface. ACM Transactions on Graphics Vol. 41, No. 6, Article No. 228, 2022.
Bonneel, N.; Coeurjolly, D. Spot: Sliced partial optimal transport. ACM Transactions on Graphics Vol. 38, No. 4, Article No. 89, 2019.
Mandad, M.; Cohen-Steiner, D.; Kobbelt, L.; Alliez, P.; Desbrun, M. Variance-minimizing transport plans for inter-surface mapping. ACM Transactions on Graphics Vol. 36, No. 4, Article No. 39, 2017.
De Goes, F.; Cohen-Steiner, D.; Alliez, P.; Desbrun, M. An optimal transport approach to robust reconstruction and simplification of 2D shapes. Computer Graphics Forum Vol. 30, No. 5, 1593–1602, 2011.
Flamary, R.; Courty, N.; Gramfort, A.; Alaya, M. Z.; Boisbunon, A.; Chambon, S.; Chapel, L.; Corenflos, A.; Fatras, K.; Fournier, N.; et al. POT: Python optimal transport. Journal of Machine Learning Research Vol. 22, No. 78, 1–8, 2021.
Du, Q.; Faber, V.; Gunzburger, M. Centroidal voronoi tessellations: Applications and algorithms. SIAM Review Vol. 41, No. 4, 637–676, 1999.
This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made.
The images or other third party material in this article are included in the article’s Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article’s Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
Other papers from this open access journal are available free of charge from http://www.springer.com/journal/41095. To submit a manuscript, please go to https://www.editorialmanager.com/cvmj.