“Robust Low-Poly Meshing for General 3D Models” by Chen, Pan, Wu, Vouga and Gao

  • ©

Conference:


Type(s):


Title:

    Robust Low-Poly Meshing for General 3D Models

Session/Category Title:   All About Meshes


Presenter(s)/Author(s):


Moderator(s):



Abstract:


    We propose a robust re-meshing approach that can automatically generate visual-preserving low-poly meshes for any high-poly models found in the wild. Our method can be seamlessly integrated into current mesh-based 3D asset production pipelines. Given an input high-poly, our method proceeds in two stages: 1) Robustly extracting an offset surface mesh that is feature-preserving, and guaranteed to be watertight, manifold, and self-intersection free; 2) Progressively simplifying and flowing the offset mesh to bring it close to the input. The simplicity and the visual-preservation of the generated low-poly is controlled by a user-required target screen size of the input: decreasing the screen size reduces the element count of the low-poly but enlarges its visual difference from the input. We have evaluated our method on a subset of the Thingi10K dataset that contains models created by practitioners in different domains, with varying topological and geometric complexities. Compared to state-of-the-art approaches and widely used software, our method demonstrates its superiority in terms of the element count, visual preservation, geometry, and topology guarantees of the generated low-polys.

References:


    1. Donya Labs AB. 2022. Simplygon 9. https://www.simplygon.com/Home/Index#section-solutions
    2. Marco Attene. 2010. A lightweight approach to repairing digitized polygon meshes. The Visual Computer 26 (2010), 1393–1406.
    3. Marco Attene, Daniela Giorgi, Massimo Ferri, and Bianca Falcidieno. 2009. On converting sets of tetrahedra to combinatorial and PL manifolds. Computer Aided Geometric Design 26, 8 (2009), 850–864.
    4. Gavin Barill, Neil G. Dickson, Ryan Schmidt, David I. W. Levin, and Alec Jacobson. 2018. Fast Winding Numbers for Soups and Clouds. ACM Trans. Graph. 37, 4, Article 43 (jul 2018), 12 pages.
    5. Jean-Philippe Bauchet and Florent Lafarge. 2020. Kinetic Shape Reconstruction. ACM Trans. Graph. 39, 5, Article 156 (jun 2020), 14 pages.
    6. Hervé Brönnimann, Andreas Fabri, Geert-Jan Giezeman, Susan Hert, Michael Hoffmann, Lutz Kettner, Sylvain Pion, and Stefan Schirra. 2022. 2D and 3D Linear Geometry Kernel. In CGAL User and Reference Manual (5.5.1 ed.). CGAL Editorial Board.
    7. Stéphane Calderon and Tamy Boubekeur. 2017. Bounding Proxies for Shape Approximation. ACM Trans. Graph. 36, 4, Article 57 (jul 2017), 13 pages.
    8. Anne-Laure Chauve, Patrick Labatut, and Jean-Philippe Pons. 2010. Robust piecewise-planar 3D reconstruction and completion from large-scale unstructured point data. In 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR). 1261–1268.
    9. Ding-Yun Chen, Xiao-Pei Tian, Yu-Te Shen, and Ming Ouhyoung. 2003. On Visual Similarity Based 3D Model Retrieval. Computer Graphics Forum 22, 3 (2003), 223–232.
    10. Zhiqin Chen, Andrea Tagliasacchi, Thomas Funkhouser, and Hao Zhang. 2022a. Neural Dual Contouring. ACM Trans. Graph. 41, 4, Article 104 (jul 2022), 13 pages.
    11. Zhiqin Chen, Andrea Tagliasacchi, and Hao Zhang. 2020. BSP-Net: Generating Compact Meshes via Binary Space Partitioning. In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society, Los Alamitos, CA, USA, 42–51.
    12. Zhiqin Chen, Kangxue Yin, and Sanja Fidler. 2022b. AUV-Net: Learning Aligned UV Maps for Texture Transfer and Synthesis. In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society, Los Alamitos, CA, USA, 1455–1464.
    13. Zhiqin Chen and Hao Zhang. 2021. Neural Marching Cubes. ACM Trans. Graph. 40, 6, Article 251 (dec 2021), 15 pages.
    14. Evgeni V Chernyaev. 1995. Marching cubes 33: construction of topologically correct isosurfaces. Tech. Rep. CERN CN/95-17 (1995).
    15. Paolo Cignoni, Marco Callieri, Massimiliano Corsini, Matteo Dellepiane, Fabio Ganovelli, and Guido Ranzuglia. 2008. MeshLab: an Open-Source Mesh Processing Tool. In Eurographics Italian Chapter Conference, Vittorio Scarano, Rosario De Chiara, and Ugo Erra (Eds.). The Eurographics Association.
    16. P. Cignoni, C. Rocchini, and R. Scopigno. 1998. Metro: Measuring Error on Simplified Surfaces. Computer Graphics Forum 17, 2 (1998), 167–174.
    17. David Cohen-Steiner, Pierre Alliez, and Mathieu Desbrun. 2004. Variational Shape Approximation. ACM Trans. Graph. 23, 3 (aug 2004), 905–914.
    18. Lis Custodio, Tiago Etiene, Sinesio Pesco, and Claudio Silva. 2013. Practical considerations on Marching Cubes 33 topological correctness. Computers and Graphics 37, 7 (2013), 840–850.
    19. B. R. de Araújo, Daniel S. Lopes, Pauline Jepp, Joaquim A. Jorge, and Brian Wyvill. 2015. A Survey on Implicit Surface Polygonization. ACM Comput. Surv. 47, 4, Article 60 (may 2015), 39 pages.
    20. Lorenzo Diazzi and Marco Attene. 2021. Convex Polyhedral Meshing for Robust Solid Modeling. ACM Trans. Graph. 40, 6, Article 259 (dec 2021), 16 pages.
    21. Akio Doi and Akio Koide. 1991. An efficient method of triangulating equi-valued surfaces by using tetrahedral cells. IEICE Transactions on Information and Systems (1991).
    22. Matin J. Dürst. 1988. Letters: additional reference to marching cubes. Computer Graphics (1988).
    23. Hao Fang and Florent Lafarge. 2020. Connect-and-Slice: An Hybrid Approach for Reconstructing 3D Objects. In 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). 13487–13495.
    24. Hao Fang, Florent Lafarge, and Mathieu Desbrun. 2018. Planar Shape Detection at Structural Scales. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). 2965–2973.
    25. Xifeng Gao, Hanxiao Shen, and Daniele Panozzo. 2019. Feature Preserving Octree-Based Hexahedral Meshing. Computer Graphics Forum 38 (08 2019), 135–149.
    26. Xifeng Gao, Kui Wu, and Zherong Pan. 2022. Low-Poly Mesh Generation for Building Models. In Special Interest Group on Computer Graphics and Interactive Techniques Conference Proceedings (Vancouver, BC, Canada) (SIGGRAPH22 Conference Proceeding). Association for Computing Machinery, New York, NY, USA, Article 3, 9 pages.
    27. Michael Garland and Paul S. Heckbert. 1997. Surface Simplification Using Quadric Error Metrics. In Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’97). ACM Press/Addison-Wesley Publishing Co., USA, 209–216.
    28. Dong-Hoon Han, Chang-Jin Lee, Sangbin Lee, and Hyeong-Seok Ko. 2021. Tight Normal Cone Merging for Efficient Collision Detection of Thin Deformable Objects. In Eurographics 2021 – Short Papers, Holger Theisel and Michael Wimmer (Eds.). The Eurographics Association.
    29. Jon Hasselgren, Jacob Munkberg, Jaakko Lehtinen, Miika Aittala, and Samuli Laine. 2021. Appearance-Driven Automatic 3D Model Simplification. In Eurographics Symposium on Rendering – DL-only Track, Adrien Bousseau and Morgan McGuire (Eds.). The Eurographics Association, Prague, Czech Republic, 19 pages.
    30. Hugues Hoppe. 1996. Progressive Meshes. In Proceedings of the 23rd Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’96). Association for Computing Machinery, New York, NY, USA, 99–108.
    31. Hugues Hoppe. 1999. New Quadric Metric for Simplifiying Meshes with Appearance Attributes. In Proceedings of the Conference on Visualization ’99: Celebrating Ten Years (San Francisco, California, USA) (VIS ’99). IEEE Computer Society Press, Washington, DC, USA, 59–66.
    32. Yixin Hu, Teseo Schneider, Bolun Wang, Denis Zorin, and Daniele Panozzo. 2020. Fast Tetrahedral Meshing in the Wild. ACM Trans. Graph. 39, 4, Article 117 (July 2020), 18 pages.
    33. Yixin Hu, Qingnan Zhou, Xifeng Gao, Alec Jacobson, Denis Zorin, and Daniele Panozzo. 2018. Tetrahedral Meshing in the Wild. ACM Trans. Graph. 37, 4, Article 60 (July 2018), 14 pages.
    34. Jin Huang, Tengfei Jiang, Zeyun Shi, Yiying Tong, Hujun Bao, and Mathieu Desbrun. 2014. ℓ1-Based Construction of Polycube Maps from Complex Shapes. ACM Trans. Graph. 33, 3, Article 25 (jun 2014), 11 pages.
    35. Jingwei Huang, Yichao Zhou, and Leonidas Guibas. 2020. ManifoldPlus: A Robust and Scalable Watertight Manifold Surface Generation Method for Triangle Soups. (2020). arXiv:2005.11621
    36. Alec Jacobson, Daniele Panozzo, et al. 2018. libigl: A simple C++ geometry processing library. https://libigl.github.io/.
    37. Tao Ju, Frank Losasso, Scott Schaefer, and Joe Warren. 2002. Dual Contouring of Hermite Data. ACM Trans. Graph. 21, 3 (jul 2002), 339–346.
    38. Tao Ju and Tushar Udeshi. 2006. Intersection-free contouring on an octree grid. Pacific Graphics Poster (01 2006).
    39. Tero Karras. 2012. Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees. In Proceedings of the Fourth ACM SIGGRAPH / Eurographics Conference on High-Performance Graphics (Paris, France) (EGGH-HPG’12). Eurographics Association, Goslar, DEU, 33–37.
    40. Tom Kelly, John Femiani, Peter Wonka, and Niloy J. Mitra. 2017. BigSUR: Large-Scale Structured Urban Reconstruction. ACM Trans. Graph. 36, 6, Article 204 (nov 2017), 16 pages.
    41. Dawar Khan, Alexander Plopski, Yuichiro Fujimoto, Masayuki Kanbara, Gul Jabeen, Yongjie Jessica Zhang, Xiaopeng Zhang, and Hirokazu Kato. 2022. Surface Remeshing: A Systematic Literature Review of Methods and Research Directions. IEEE Transactions on Visualization and Computer Graphics 28, 3 (2022), 1680–1713.
    42. Leif P. Kobbelt, Mario Botsch, Ulrich Schwanecke, and Hans-Peter Seidel. 2001. Feature Sensitive Surface Extraction from Volume Data. In Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’01). Association for Computing Machinery, New York, NY, USA, 57–66.
    43. Samuli Laine, Janne Hellsten, Tero Karras, Yeongho Seol, Jaakko Lehtinen, and Timo Aila. 2020. Modular Primitives for High-Performance Differentiable Rendering. ACM Trans. Graph. 39, 6, Article 194 (nov 2020), 14 pages.
    44. Thibault Lescoat, Hsueh-Ti Derek Liu, Jean-Marc Thiery, Alec Jacobson, Tamy Boubekeur, and Maks Ovsjanikov. 2020. Spectral Mesh Simplification. Computer Graphics Forum 39, 2 (2020), 315–324.
    45. Thomas Lewiner, Hélio Lopes, Antônio Wilson Vieira, and Geovan Tavares. 2003. Efficient Implementation of Marching Cubes’ Cases with Topological Guarantees. Journal of Graphics Tools 8, 2 (2003), 1–15.
    46. Minglei Li and Liangliang Nan. 2021. Feature-preserving 3D mesh simplification for urban buildings. ISPRS Journal of Photogrammetry and Remote Sensing 173 (2021), 135–150.
    47. Yiyi Liao, Simon Donné, and Andreas Geiger. 2018. Deep Marching Cubes: Learning Explicit Surface Representations. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2916–2925.
    48. Peter Lindstrom and Greg Turk. 1998. Fast and Memory Efficient Polygonal Simplification. In Proceedings of the Conference on Visualization ’98 (Research Triangle Park, North Carolina, USA) (VIS ’98). IEEE Computer Society Press, Washington, DC, USA, 279–286.
    49. Peter Lindstrom and Greg Turk. 2000. Image-Driven Simplification. ACM Trans. Graph. 19, 3 (jul 2000), 204–241.
    50. Songrun Liu, Zachary Ferguson, Alec Jacobson, and Yotam Gingold. 2017. Seamless: Seam Erasure and Seam-Aware Decoupling of Shape from Mesh Resolution. ACM Trans. Graph. 36, 6, Article 216 (nov 2017), 15 pages.
    51. Adriano Lopes and Ken Brodlie. 2003. Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing. IEEE Transactions on Visualization and Computer Graphics 9, 1 (2003), 16–29.
    52. William E. Lorensen and Harvey E. Cline. 1987. Marching Cubes: A High Resolution 3D Surface Construction Algorithm. In Proceedings of the 14th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH ’87). Association for Computing Machinery, New York, NY, USA, 163–169.
    53. Fujun Luan, Shuang Zhao, Kavita Bala, and Zhao Dong. 2021. Unified Shape and SVBRDF Recovery using Differentiable Monte Carlo Rendering. Computer Graphics Forum 40, 4 (2021), 101–113.
    54. Josiah Manson and Scott Schaefer. 2010. Isosurfaces Over Simplicial Partitions of Multiresolution Grids. Computer Graphics Forum 29, 2 (2010), 377–385.
    55. Jan Möbius Mario Botsch. 2015. IsoEx. https://www.graphics.rwth-aachen.de/IsoEx/index.html
    56. Sergey V. Matveyev. 1994. Approximation of Isosurface in the Marching Cube: Ambiguity Problem. In Proceedings of the Conference on Visualization ’94 (Washinton, D.C.) (VIS ’94). IEEE Computer Society Press, Washington, DC, USA, 288–292.
    57. Ravish Mehra, Qingnan Zhou, Jeremy Long, Alla Sheffer, Amy Gooch, and Niloy J. Mitra. 2009. Abstraction of Man-Made Shapes. ACM Trans. Graph. 28, 5 (dec 2009), 1–10.
    58. Jacob Munkberg, Wenzheng Chen, Jon Hasselgren, Alex Evans, Tianchang Shen, Thomas Muller, Jun Gao, and Sanja Fidler. 2022. Extracting Triangular 3D Models, Materials, and Lighting From Images. In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society, Los Alamitos, CA, USA, 8270–8280.
    59. Liangliang Nan and Peter Wonka. 2017. PolyFit: Polygonal Surface Reconstruction from Point Clouds. In 2017 IEEE International Conference on Computer Vision (ICCV). 2372–2380.
    60. Baptiste Nicolet, Alec Jacobson, and Wenzel Jakob. 2021. Large Steps in Inverse Rendering of Geometry. ACM Trans. Graph. 40, 6, Article 248 (dec 2021), 13 pages.
    61. Gregory M. Nielson. 2003. On marching cubes. IEEE Transactions on Visualization and Computer Graphics 9, 3 (2003), 283–297.
    62. Gregory M. Nielson. 2004. Dual Marching Cubes. In Proceedings of the Conference on Visualization ’04 (VIS ’04). IEEE Computer Society, USA, 489–496.
    63. Gregory M. Nielson and Bernd Hamann. 1991. The asymptotic decider: resolving the ambiguity in marching cubes. In Proceeding Visualization ’91. 83–91.
    64. Cédric Portaneri, Mael Rouxel-Labbé, Michael Hemmer, David Cohen-Steiner, and Pierre Alliez. 2022. Alpha Wrapping with an Offset. ACM Transactions on Graphics 41, 4 (June 2022), 1–22. https://hal.inria.fr/hal-03688637
    65. Leonardo Sacht, Etienne Vouga, and Alec Jacobson. 2015. Nested Cages. ACM Trans. Graph. 34, 6, Article 170 (nov 2015), 14 pages.
    66. D. Salinas, F. Lafarge, and P. Alliez. 2015. Structure-Aware Mesh Decimation. Computer Graphics Forum 34, 6 (2015), 211–227.
    67. Scott Schaefer, Tao Ju, and Joe Warren. 2007. Manifold Dual Contouring. IEEE Transactions on Visualization and Computer Graphics 13, 03 (may 2007), 610–619.
    68. Scott Schaefer and Joe Warren. 2004. Dual marching cubes: Primal contouring of dual grids. Proceedings – Pacific Conference on Computer Graphics and Applications, 70–76.
    69. Tianchang Shen, Jun Gao, Kangxue Yin, Ming-Yu Liu, and Sanja Fidler. 2021. Deep Marching Tetrahedra: a Hybrid Representation for High-Resolution 3D Shape Synthesis. In Advances in Neural Information Processing Systems (NeurIPS).
    70. David Vega, Javier Abache, and David Coll. 2019. A Fast and Memory Saving Marching Cubes 33 Implementation with the Correct Interior Test. Journal of Computer Graphics Techniques (JCGT) 8, 3 (8 August 2019), 1–18.
    71. Pascal Volino and Nadia Magnenat Thalmann. 1994. Efficient self-collision detection on smoothly discretized surface animations using geometrical shape regularity. Computer Graphics Forum (1994).
    72. Tongtong Wang, Zhihua Liu, Min Tang, Ruofeng Tong, and Dinesh Manocha. 2017. Efficient and Reliable Self-Collision Culling Using Unprojected Normal Cones. Computer Graphics Forum 36, 8 (2017), 487–498.
    73. Xinyue Wei, Minghua Liu, Zhan Ling, and Hao Su. 2022. Approximate Convex Decomposition for 3D Meshes with Collision-Aware Concavity and Tree Search. ACM Trans. Graph. 41, 4, Article 42 (jul 2022), 18 pages.
    74. Kui Wu, Xu He, Zherong Pan, and Xifeng Gao. 2022. Occluder Generation for Buildings in Digital Games. Computer Graphics Forum 41, 7 (2022), 205–214.
    75. Geoff Wyvill, Craig McPheeters, and Brian Wyvill. 1986. Data Structure for Soft Objects. The Visual Computer – VC 2 (08 1986), 227–234.
    76. Kaizhi Yang and Xuejin Chen. 2021. Unsupervised Learning for Cuboid Shape Abstraction via Joint Segmentation from Point Clouds. ACM Trans. Graph. 40, 4, Article 152 (jul 2021), 11 pages.
    77. Mulin Yu and Florent Lafarge. 2022. Finding Good Configurations of Planar Primitives in Unorganized Point Clouds. In 2022 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR). IEEE Computer Society, Los Alamitos, CA, USA, 6357–6366.
    78. Qingnan Zhou and Alec Jacobson. 2016. Thingi10K: A Dataset of 10,000 3D-Printing Models. (2016). arXiv:1605.04797


ACM Digital Library Publication:



Overview Page: