skip to main content
research-article
Open Access
Results Reproduced

HexEx: robust hexahedral mesh extraction

Published:11 July 2016Publication History
Skip Abstract Section

Abstract

State-of-the-art hex meshing algorithms consist of three steps: Frame-field design, parametrization generation, and mesh extraction. However, while the first two steps are usually discussed in detail, the last step is often not well studied. In this paper, we fully concentrate on reliable mesh extraction.

Parametrization methods employ computationally expensive countermeasures to avoid mapping input tetrahedra to degenerate or flipped tetrahedra in the parameter domain because such a parametrization does not define a proper hexahedral mesh. Nevertheless, there is no known technique that can guarantee the complete absence of such artifacts.

We tackle this problem from the other side by developing a mesh extraction algorithm which is extremely robust against typical imperfections in the parametrization. First, a sanitization process cleans up numerical inconsistencies of the parameter values caused by limited precision solvers and floating-point number representation. On the sanitized parametrization, we extract vertices and so-called darts based on intersections of the integer grid with the parametric image of the tetrahedral mesh. The darts are reliably interconnected by tracing within the parametrization and thus define the topology of the hexahedral mesh. In a postprocessing step, we let certain pairs of darts cancel each other, counteracting the effect of flipped regions of the parametrization. With this strategy, our algorithm is able to robustly extract hexahedral meshes from imperfect parametrizations which previously would have been considered defective. The algorithm will be published as an open source library [Lyon et al. 2016].

Skip Supplemental Material Section

Supplemental Material

a123.mp4

mp4

343.5 MB

References

  1. Bommes, D., Campen, M., Ebke, H.-C., Alliez, P., and Kobbelt, L. 2013. Integer-grid maps for reliable quad meshing. ACM Transactions on Graphics 32, 4 (July). Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Ebke, H.-C., Bommes, D., Campen, M., and Kobbelt, L. 2013. QEx: Robust quad mesh extraction. ACM Transactions on Graphics 32, 6 (Nov.). Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Ebke, H.-C., Campen, M., Bommes, D., and Kobbelt, L. 2014. Level-of-detail quad meshing. ACM Transactions on Graphics 33, 6 (Dec). Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Gregson, J., Sheffer, A., and Zhang, E. 2011. All-hex mesh generation via volumetric polycube deformation. Computer Graphics Forum 30, 5.Google ScholarGoogle ScholarCross RefCross Ref
  5. Huang, J., Jiang, T., Shi, Z., Tong, Y., Bao, H., and Desbrun, M. 2014. l1-based construction of polycube maps from complex shapes. ACM Trans. Graph. 33, 3 (June). Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Jiang, T., Huang, J., Wang, Y., Tong, Y., and Bao, H. 2014. Frame field singularity correction for automatic hexahedralization. IEEE Transactions on Visualization and Computer Graphics 20, 8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Kraemer, P., Untereiner, L., Jund, T., Thery, S., and Cazier, D. 2014. CGoGN: n-dimensional meshes with combinatorial maps. In Proceedings of the 22nd International Meshing Roundtable.Google ScholarGoogle Scholar
  8. Kremer, M., Bommes, D., and Kobbelt, L. 2012. OpenVolumeMesh -- a versatile index-based data structure for 3d polytopal complexes. In Proceedings of the 21st International Meshing Roundtable.Google ScholarGoogle Scholar
  9. Li, Y., Liu, Y., Xu, W., Wang, W., and Guo, B. 2012. All-hex meshing using singularity-restricted field. ACM Transactions on Graphics 31, 6 (Nov.). Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. Livesu, M., Vining, N., Sheffer, A., Gregson, J., and Scateni, R. 2013. PolyCut: Monotone graph-cuts for polycube base-complex construction. Transactions on Graphics (Proc. SIGGRAPH ASIA 2013) 32, 6. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Livesu, M., Sheffer, A., Vining, N., and Tarini, M. 2015. Practical hex-mesh optimization via edge-cone rectification. ACM Trans. Graph. 34, 4 (July). Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Lyon, M., Bommes, D., and Kobbelt, L., 2016. libHexEx: a robust hexahedral mesh extraction library. http://www.graphics.rwth-aachen.de/software/libHexEx.Google ScholarGoogle Scholar
  13. Möbius, J., and Kobbelt, L. 2012. OpenFlipper: An open source geometry processing and rendering framework. In Curves and Surfaces, vol. 6920 of Lecture Notes in Computer Science. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Nieser, M., Reitebuch, U., and Polthier, K. 2011. Cube-Cover - parameterization of 3D volumes. Comp. Graph. Forum.Google ScholarGoogle Scholar
  15. Ray, N., and Sokolov, D. 2015. On smooth 3D frame field design. Computing Research Repository.Google ScholarGoogle Scholar
  16. Shepherd, J. F., and Johnson, C. R. 2008. Hexahedral mesh generation constraints. Engineering with Computers 24, 3.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Shewchuk, J. R. 1997. Adaptive precision floating-point arithmetic and fast robust geometric predicates. Discrete & Computational Geometry 18, 3 (Oct.).Google ScholarGoogle Scholar
  18. Shimada, K. 2006. Current trends and issues in automatic mesh generation. Computer-Aided Design & Applications 3, 6.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. HexEx: robust hexahedral mesh extraction

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        • Published in

          cover image ACM Transactions on Graphics
          ACM Transactions on Graphics  Volume 35, Issue 4
          July 2016
          1396 pages
          ISSN:0730-0301
          EISSN:1557-7368
          DOI:10.1145/2897824
          Issue’s Table of Contents

          Copyright © 2016 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 11 July 2016
          Published in tog Volume 35, Issue 4

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader