Interactive all-hex meshing via cuboid decomposition

  title={Interactive all-hex meshing via cuboid decomposition},
  author={Lingxiao Li and Paul Zhang and Dmitriy Smirnov and S. M. Abulnaga and Justin M. Solomon},
  journal={ACM Transactions on Graphics (TOG)},
  pages={1 - 17}
Standard PolyCube-based hexahedral (hex) meshing methods aim to deform the input domain into an axis-aligned PolyCube volume with integer corners; if this deformation is bijective, then applying the inverse map to the voxelized PolyCube yields a valid hex mesh. A key challenge in these methods is to maintain the bijectivity of the PolyCube deformation, thus reducing the robustness of these algorithms. In this work, we present an interactive pipeline for hex meshing that sidesteps this challenge… 


Practical hex-mesh optimization via edge-cone rectification
This work recast hex quality improvement as an optimization of the shape of overlapping cones, or unions, of tetrahedra surrounding every directed edge in the hex mesh, and forms a novel framework for optimizing hex-mesh quality capable of generating inversion-free high-quality meshes from such poor initial inputs.
All‐Hex Mesh Generation via Volumetric PolyCube Deformation
This work introduces a new method for computing low‐distortion volumetric PolyCube deformations of general shapes and for subsequent all‐hex remeshing that automatically generates good quality all-hex meshes of complex natural and man‐made shapes.
Cut-enhanced PolyCube-maps for feature-aware all-hex meshing
By inserting proper parameterization seams into the initial PolyCube-Map via novel PolyCube cutting operations, the mapping distortion can be reduced significantly, and the efficacy of the method is validated on a collection of more than one hundred CAD models and demonstrates its advantages over other automatic all-hex meshing methods and padding strategies.
ℓ1-Based Construction of Polycube Maps from Complex Shapes
A variational method for deforming an input triangle mesh into a polycube shape through minimization of the ℓ1-norm of the mesh normals, regularized via an as-rigid-as-possible volumetric distortion energy.
Singularity-constrained octahedral fields for hexahedral meshing
The first contribution of this work is an enumeration of all local configurations that exist in hex meshes with bounded edge valence, and a generalization of the Hopf-Poincaré formula to octahedral fields, leading to necessary local and global conditions for the hex-meshability of anOctahedral field in terms of its singularity graph.
Instant field-aligned meshes
We present a novel approach to remesh a surface into an isotropic triangular or quad-dominant mesh using a unified local smoothing operator that optimizes both the edge orientations and vertex
Selective Padding for Polycube‐Based Hexahedral Meshing
This work proposes a novel optimization method which inserts sheets of hexahedra so as to perform selective padding, where it is most needed for improving the mesh quality, and shows in a series of experiments that this approach increases the MSJ value and preserves (or even improves) the ASJ, while adding fewer hex ahedra than global padding.
Dual Sheet Meshing: An Interactive Approach to Robust Hexahedralization
This work proposes a simple algorithm for primalizing the dual graph where each dual cell gets mapped onto a reference polyhedron via harmonic parameterization, greatly simplifying many of the computational steps such as finding intersections and analyzing topology.
Computing Surface PolyCube‐Maps by Constrained Voxelization
A novel method to compute bijective PolyCube‐maps with low isometric distortion, which achieves higher practical robustness and lower mapping distortion than state‐of‐the‐art methods.
Fixing normal constraints for generation of polycubes
Many efforts have been devoted to mesh a volume with hexahedral elements. One of the proposed methods consist in : deforming the original volume such that its boundary normal vector is always aligned