AlgoHex: Algorithmic Hexahedral Mesh Generation
Logos of University of Bern, EU, European Research Council
  • Home
  • News
  • Team
  • Code
  • Publications
  • Hex-Mesh Generation and Processing: a Survey

    ACM Transactions on Graphics
    Nico Pietroni, Marcel Campen, Alla Sheffer, Gianmarco Cherchi, David Bommes, Xifeng Gao, Riccardo Scateni, Franck Ledoux, Jean-François Remacle, Marco Livesu
    • Project page
    • Preprint (arXiv) PDF (8.0 MB)
    • ACM Digital Library
    • BibTeX
    @article{10.1145/3528223.3530123,
    author = {Br\"{u}ckler, Hendrik and Bommes, David and Campen, Marcel},
    title = {Volume Parametrization Quantization for Hexahedral Meshing},
    year = {2022},
    issue_date = {July 2022},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    volume = {41},
    number = {4},
    issn = {0730-0301},
    url = {https://doi.org/10.1145/3528223.3530123},
    doi = {10.1145/3528223.3530123},
    abstract = {Developments in the field of parametrization-based quad mesh generation on surfaces have been impactful over the past decade. In this context, an important advance has been the replacement of error-prone rounding in the generation of integer-grid maps, by robust quantization methods. In parallel, parametrization-based hex mesh generation for volumes has been advanced. In this volumetric context, however, the state-of-the-art still relies on fragile rounding, not rarely producing defective meshes, especially when targeting a coarse mesh resolution. We present a method to robustly quantize volume parametrizations, i.e., to determine guaranteed valid choices of integers for 3D integer-grid maps. Inspired by the 2D case, we base our construction on a non-conforming cell decomposition of the volume, a 3D analogue of a T-mesh. In particular, we leverage the motorcycle complex, a recent generalization of the motorcycle graph, for this purpose. Integer values are expressed in a differential manner on the edges of this complex, enabling the efficient formulation of the conditions required to strictly prevent forcing the map into degeneration. Applying our method in the context of hexahedral meshing, we demonstrate that hexahedral meshes can be generated with significantly improved flexibility.},
    journal = {ACM Trans. Graph.},
    month = {jul},
    articleno = {60},
    numpages = {19},
    keywords = {hexahedral mesh, base complex, block decomposition, multi-block, t-mesh, block-structured, volume mesh}
    }
  • Volume Parametrization Quantization for Hexahedral Meshing

    ACM Transactions on Graphics (SIGGRAPH 2022)
    Hendrik Brückler, David Bommes, Marcel Campen
    • Project page
    • Paper PDF (22.0 MB)
    • ACM Digital Library
    • Code
    • BibTeX
    @article{10.1145/3528223.3530123,
    author = {Br\"{u}ckler, Hendrik and Bommes, David and Campen, Marcel},
    title = {Volume Parametrization Quantization for Hexahedral Meshing},
    year = {2022},
    issue_date = {July 2022},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    volume = {41},
    number = {4},
    issn = {0730-0301},
    url = {https://doi.org/10.1145/3528223.3530123},
    doi = {10.1145/3528223.3530123},
    abstract = {Developments in the field of parametrization-based quad mesh generation on surfaces have been impactful over the past decade. In this context, an important advance has been the replacement of error-prone rounding in the generation of integer-grid maps, by robust quantization methods. In parallel, parametrization-based hex mesh generation for volumes has been advanced. In this volumetric context, however, the state-of-the-art still relies on fragile rounding, not rarely producing defective meshes, especially when targeting a coarse mesh resolution. We present a method to robustly quantize volume parametrizations, i.e., to determine guaranteed valid choices of integers for 3D integer-grid maps. Inspired by the 2D case, we base our construction on a non-conforming cell decomposition of the volume, a 3D analogue of a T-mesh. In particular, we leverage the motorcycle complex, a recent generalization of the motorcycle graph, for this purpose. Integer values are expressed in a differential manner on the edges of this complex, enabling the efficient formulation of the conditions required to strictly prevent forcing the map into degeneration. Applying our method in the context of hexahedral meshing, we demonstrate that hexahedral meshes can be generated with significantly improved flexibility.},
    journal = {ACM Trans. Graph.},
    month = {jul},
    articleno = {60},
    numpages = {19},
    keywords = {hexahedral mesh, base complex, block decomposition, multi-block, t-mesh, block-structured, volume mesh}
    }
  • Hex Me If You Can

    Computer Graphics Forum (SGP 2022)
    Pierre-Alexandre Beaufort, Maxence Reberol, Denis Kalmykov, Heng Liu, Franck Ledoux, David Bommes
    • Project page
    • Paper (compressed) PDF (1.9 MB)
    • HexMe dataset (~1.5GB zip)
    • HexMe catalog
    • HexMe workflow
    • BibTeX
    @article {10.1111:cgf.14608,
    journal = {Computer Graphics Forum},
    title = {{Hex Me If You Can}},
    author = {Beaufort, Pierre-Alexandre and Reberol, Maxence and Kalmykov, Denis and Liu, Heng and Ledoux, Franck and Bommes, David},
    year = {2022},
    publisher = {The Eurographics Association and John Wiley & Sons Ltd.},
    ISSN = {1467-8659},
    DOI = {10.1111/cgf.14608}
    }
  • TinyAD: Automatic Differentiation in Geometry Processing Made Simple

    Computer Graphics Forum (SGP 2022, Best Paper Award)
    Patrick Schmidt, Janis Born, David Bommes, Marcel Campen, Leif Kobbelt
    • Project page
    • Paper (low resolution) PDF (2.9 MB)
    • Best Paper Award
    • Code
    • Examples
    • BibTeX
    @article{schmidt2022tinyad,
      title={{TinyAD}: Automatic Differentiation in Geometry Processing Made Simple},
      author={Schmidt, Patrick and Born, Janis and Bommes, David and Campen, Marcel and Kobbelt, Leif},
      year={2022},
      journal={Computer Graphics Forum},
      volume={41},
      number={5},
    }
  • Cost Minimizing Local Anisotropic Quad Mesh Refinement

    Computer Graphics Forum (SGP 2020)
    Max Lyon, David Bommes, Leif Kobbelt
    • Project page
    • PDF (26.0 MB)
    • CGF repository
    • BibTeX
    @article{Lyon:2020:Cost,
      title        = {Cost Minimizing Local Anisotropic Quad Mesh Refinement},
      author       = {Lyon, Max and Bommes, David and Kobbelt, Leif},
      journal      = {Computer Graphics Forum},
      volume       = {39},
      number       = {5},
      year         = {2020},
      doi          = {10.1111/cgf.14076}
    }
  • Integer-Grid Sketch Simplification and Vectorization

    Computer Graphics Forum (SGP 2020)
    Tibor Stanko, Mikhail Bessmeltsev, David Bommes, Adrien Bousseau
    • Project page
    • PDF (27.8 MB)
    • Supplemental (52.4 MB)
    • CGF repository
    • Git
    • BibTeX
    @Article{SBBB20,
      author       = "Stanko, Tibor and Bessmeltsev, Mikhail and Bommes, David and Bousseau, Adrien",
      title        = "Integer-Grid Sketch Simplification and Vectorization",
      journal      = "Computer Graphics Forum (Proceedings of the Eurographics Symposium on Geometry Processing)",
      number       = "5",
      volume       = "39",
      pages        = "149--161",
      month        = "jul",
      year         = "2020",
      keywords     = "line drawing, vectorization, grid parametrization"
    }
     
  • Algebraic Representations for Volumetric Frame Fields

    ACM Transactions on Graphics (SIGGRAPH 2020)
    David Palmer, David Bommes, Justin Solomon
    • Project page
    • PDF (12.4 MB)
    • GitHub
    • ACM Digital Library
    • BibTeX
    @article{10.1145/3366786,
    author = {Palmer, David and Bommes, David and Solomon, Justin},
    title = {Algebraic Representations for Volumetric Frame Fields},
    year = {2020},
    issue_date = {April 2020},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    volume = {39},
    number = {2},
    issn = {0730-0301},
    url = {https://doi.org/10.1145/3366786},
    doi = {10.1145/3366786},
    journal = {ACM Trans. Graph.},
    month = apr,
    articleno = {Article 16},
    numpages = {17},
    keywords = {convex algebraic geometry, octahedral frame fields, Hexahedral meshing, convex relaxations}
    }
  • Octahedral Frames for Feature-Aligned Cross Fields

    ACM Transactions on Graphics (SIGGRAPH 2020)
    Paul Zhang, Josh Vekhter, Edward Chien, David Bommes, Etienne Vouga, Justin Solomon
    • Project page
    • PDF (27.7 MB)
    • ACM Digital Library
    • BibTeX
    @article{10.1145/3374209,
    author = {Zhang, Paul and Vekhter, Josh and Chien, Edward and Bommes, David and Vouga, Etienne and Solomon, Justin},
    title = {Octahedral Frames for Feature-Aligned Cross Fields},
    year = {2020},
    issue_date = {June 2020},
    publisher = {Association for Computing Machinery},
    address = {New York, NY, USA},
    volume = {39},
    number = {3},
    issn = {0730-0301},
    url = {https://doi.org/10.1145/3374209},
    doi = {10.1145/3374209},
    journal = {ACM Trans. Graph.},
    month = apr,
    articleno = {25},
    numpages = {13},
    keywords = {total variation, Discrete differential geometry, geometry processing, singularities, feature alignment}
    }
© Copyright 2019–2023 by Computer Graphics Group, University of Bern.
Privacy policy