Journal Home > Volume 4 , Issue 2

Surface remeshing is widely required in modeling, animation, simulation, and many other computer graphics applications. Improving the elements’ quality is a challenging task in surface remeshing. Existing methods often fail to efficiently remove poor-quality elements especially in regions with sharp features. In this paper, we propose and use a robust segmentation method followed by remeshing the segmented mesh. Mesh segmentation is initiated using an existing Live-wire interaction approach and is further refined using local mesh operations. The refined segmented mesh is finally sent to the remeshing pipeline, in which each mesh segment is remeshed independently. An experimental study compares our mesh segmentation method as well as remeshing results with representative existing methods. We demonstrate that the proposed segmentation method is robust and suitable for remeshing.


menu
Abstract
Full text
Outline
About this article

Surface remeshing with robust user-guided segmentation

Show Author's information Dawar Khan1,2Dong-Ming Yan1,2( )Fan Ding1Yixin Zhuang3Xiaopeng Zhang1,2
National Laboratory of Pattern Recognition, Institute of Automation, Chinese Academy of Sciences, Beijing, 100190, China.
University of Chinese Academy of Sciences, Beijing, 100049, China.
National Digital Switching System Engineering & Technological Research Center, China.

Abstract

Surface remeshing is widely required in modeling, animation, simulation, and many other computer graphics applications. Improving the elements’ quality is a challenging task in surface remeshing. Existing methods often fail to efficiently remove poor-quality elements especially in regions with sharp features. In this paper, we propose and use a robust segmentation method followed by remeshing the segmented mesh. Mesh segmentation is initiated using an existing Live-wire interaction approach and is further refined using local mesh operations. The refined segmented mesh is finally sent to the remeshing pipeline, in which each mesh segment is remeshed independently. An experimental study compares our mesh segmentation method as well as remeshing results with representative existing methods. We demonstrate that the proposed segmentation method is robust and suitable for remeshing.

Keywords: mesh generation, mesh segmentation, surface remeshing, triangulation

References(39)

[1]
Alliez, P.; Ucelli, G.; Gotsman, C.; Attene, M. Recent advances in remeshing of surfaces. In: Shape Analysis and Structuring. Mathematics and Visualization. De Floriani, L.; Spagnuolo, M. Eds. Springer, Berlin, Heidelberg, 53-82, 2008.
DOI
[2]
Alliez, P.; Meyer, M.; Desbrun, M. Interactive geometry remeshing. ACM Transactions on Graphics Vol. 21, No. 3, 347-354, 2002.
[3]
Yan, D.-M.; Lévy, B.; Liu, Y.; Sun, F.; Wang, W. Isotropic remeshing with fast and exact computation of restricted Voronoi diagram. Computer Graphics Forum Vol. 28, No. 5, 1445-1454, 2009.
[4]
Valette, S.; Chassery, J.-M.; Prost, R. Generic remeshing of 3D triangular meshes with metric-dependent discrete Voronoi diagrams. IEEE Transactions on Visualization and Computer Graphics Vol. 14, No. 2, 369-381, 2008.
[5]
Hu, K.; Yan, D. M.; Bommes, D.; Alliez, P.; Benes, B. Error-bounded and feature preserving surface remeshing with minimal angle improvement. IEEE Transactions on Visualization and Computer Graphics Vol. 23, No. 12, 2560-2573, 2017.
[6]
Edwards, J.; Wang, W.; Bajaj, C. L. Surface segmentation for improved remeshing. In: Proceedings of the 21st International Meshing Roundtable, 403-418, 2013.
DOI
[7]
Zhuang, Y.; Zou, M.; Carr, N.; Ju, T. Anisotropic geodesics for live-wire mesh segmentation. Computer Graphics Forum Vol. 33, No. 7, 111-120, 2014.
[8]
Heckbert, P. S.; Garland, M. Survey of polygonal surface simplification algorithms. Carnegie-Mellon Univ Pittsburgh PA School of Computer Science, 1997.
[9]
Liu, Y.-J.; Xu, C.-X.; Fan, D.; He, Y. Efficient construction and simplification of Delaunay meshes. ACM Transactions on Graphics Vol. 34, No. 6, Article No. 174, 2015.
[10]
Schreiner, J.; Scheidegger, C. E.; Fleishman, S.; Silva, C. T. Direct (re)meshing for efficient surface processing. Computer Graphics Forum Vol. 25, No. 3, 527-536, 2006.
[11]
Cheng, S.-W.; Dey, T. K.; Shewchuk, J. R. Delaunay Mesh Generation. CRC Press, 2012.
[12]
Lai, Y.-K.; Jin, M.; Xie, X.; He, Y.; Palacios, J.; Zhang, E.; Hu, S.-M.; Gu, X. Metric-driven RoSy field design and remeshing. IEEE Transactions on Visualization and Computer Graphics Vol. 16, No. 1, 95-108, 2010.
[13]
Nieser, M.; Palacios, J.; Polthier, K.; Zhang, E. Hexagonal global parameterization of arbitrary surfaces. IEEE Transactions on Visualization and Computer Graphics Vol. 18, No. 6, 865-878, 2012.
[14]
Jakob, W.; Tarini, M.; Panozzo, D.; Sorkine-Hornung, O. Instant field-aligned meshes. ACM Transactions on Graphics Vol. 34, No. 6, Article No. 189, 2015.
[15]
Hoppe, H.; DeRose, T.; Duchamp, T.; McDonald, J.; Stuetzle, W. Mesh optimization. In: Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques, 19-26, 1993.
DOI
[16]
Botsch, M.; Kobbelt, L. A remeshing approach to multiresolution modeling. In: Proceedings of the Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, 185-192, 2004.
DOI
[17]
Dunyach, M.; Vanderhaeghe, D.; Barthe, L.; Botsch, M. Adaptive remeshing for real-time mesh deformation. In: Proceedings of the Eurographics, 29-32, 2013.
[18]
Wang, Y.; Yan, D.-M.; Tang, C.; Liu, X. Obtuse triangle elimination for isotropic remeshing. In: Proceedings of the ACM SIGGRAPH 2017 Posters, Article No. 81, 2017.
DOI
[19]
Surazhsky, V.; Alliez, P.; Gotsman, C. Isotropic remeshing of surfaces: A local parameterization approach. In: Proceedings of the 12th International Meshing Roundtable, 204-231, 2003.
[20]
Marchandise, E.; Remacle, J.-F.; Geuzaine, C. Optimal parametrizations for surface remeshing. Engineering with Computers Vol. 30, No. 3, 383-402, 2014.
[21]
Fu, Y.; Zhou, B. Direct sampling on surfaces for high quality remeshing. In: Proceedings of the ACM Symposium on Solid and Physical Modeling, 115-124, 2008.
DOI
[22]
Chen, Z.; Cao, J.; Wang, W. Isotropic surface remeshing using constrained centroidal delaunay mesh. Computer Graphics Forum Vol. 31, No. 7, 2077-2085, 2012.
[23]
Yan, D.-M.; Bao, G.; Zhang, X.; Wonka, P. Low-resolution remeshing using the localized restricted Voronoi diagram. IEEE Transactions on Visualization and Computer Graphics Vol. 20, No. 10, 1418-1427, 2014.
[24]
Wang, X.; Ying, X.; Liu, Y.-J.; Xin, S.-Q.; Wang, W.; Gu, X.; Mueller-Wittig, W.; He, Y. Intrinsic computation of centroidal Voronoi tessellation (CVT) on meshes. Computer-Aided Design Vol. 58, 51-61, 2015.
[25]
Liu, Y.-J.; Xu, C.-X.; Yi, R.; Fan, D.; He, Y. Manifold differential evolution (MDE): A global optimization method for geodesic centroidal Voronoi tessellations on meshes. ACM Transactions on Graphics Vol. 35, No. 6, Article No, 243, 2016.
[26]
Yan, D.-M.; Wonka, P. Non-obtuse remeshing with centroidal Voronoi tessellation. IEEE Transactions on Visualization and Computer Graphics Vol. 22, No. 9, 2136-2144, 2016.
[27]
Ahmed, A. G. M.; Guo, J.; Yan, D.-M.; Franceschi, J.-Y.; Zhang, X.; Deussen, O. A simple push–pull algorithm for blue-noise sampling. IEEE Transactions on Visualization and Computer Graphics Vol. 23, No. 12, 2496-2508, 2017.
[28]
Fuhrmann, S.; Ackermann, J.; Kalbe, T.; Goesele, M. Direct resampling for isotropic surface remeshing. In: Vision, Modeling, and Visualization. Koch, R.; Kolb, A.; Rezk-Salama, C. Eds. The Eurographics Association, 9-16, 2010.
[29]
Lévy, B.; Liu, Y. Lp centroidal Voronoi tessellation and its applications. ACM Transactions on Graphics Vol. 29, No. 4, Article No. 119, 2010.
[30]
Payan, F.; Roudet, C.; Sauvage, B. Semi-regular triangle remeshing: A comprehensive study. Computer Graphics Forum Vol. 34, No. 1, 86-102, 2015.
[31]
Lee, A.; Moreton, H.; Hoppe, H. Displaced subdivision surfaces. In: Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, 85-94, 2000.
DOI
[32]
Mansouri, S.; Ebrahimnezhad, H. Segmentation-based semi-regular remeshing of 3D models using curvature-adapted subdivision surface fitting. Journal of Visualization Vol. 19, No. 1, 141-155, 2016.
[33]
Cohen-Steiner, D.; Alliez, P.; Desbrun, M. Variational shape approximation. ACM Transactions on Graphics Vol. 23, No. 3, 905-914, 2004.
[34]
Zhou, K.; Snyder, J.; Guo, B.; Shum, H.-Y. Iso-charts: Stretch-driven mesh parameterization using spectral analysis. In: Proceeding of the Eurographics/ACM SIGGRAPH Symposium on Geometry Processing, 45-54, 2004.
DOI
[35]
De Goes, F.; Goldenstein, S.; Desbrun, M.; Velho, L. EXOSKELETON: Curve network abstraction for 3D shapes. Computers & Graphics Vol. 35, No. 1, 112-121, 2011.
[36]
Cao, Y.; Yan, D.-M.; Wonka, P. Patch layout generation by detecting feature networks. Computers & Graphics Vol. 46, 275-282, 2015.
[37]
Shamir, A. A survey on mesh segmentation techniques. Computer Graphics Forum Vol. 27, No. 6, 1539-1556, 2008.
[38]
Frey, P. J.; Borouchaki, H. Surface mesh evaluation. In: Proceedings of the 6th International Meshing Roundtable, 363-374, 1997.
[39]
Farin, G. E. Shape measures for triangles. IEEE Transactions on Visualization and Computer Graphics Vol. 18, No. 1, 43-46, 2012.
Publication history
Copyright
Acknowledgements
Rights and permissions

Publication history

Revised: 25 December 2017
Accepted: 31 December 2017
Published: 16 March 2018
Issue date: June 2018

Copyright

© The Author(s) 2018

Acknowledgements

This work was partially funded by the National Natural Science Foundation of China (Nos. 61772523, 61372168, 61620106003, and 61331018). The first author was supported by a Chinese Government Scholarship.

Rights and permissions

This article is published with open access at Springerlink.com

The articles published in this journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http:// creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

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.

Return