Spectral Quadrangulation with Feature Curve Alignment and Element Size Control

Existing methods for surface quadrangulation cannot ensure accurate alignment with feature or boundary curves and tight control of local element size, which are important requirements in many numerical applications (e.g., FEA). Some methods rely on a prescribed direction field to guide quadrangulation for feature alignment, but such a direction field may conflict with a desired density field, thus making it difficult to control the element size. We propose a new spectral method that achieves both accurate feature curve alignment and tight control of local element size according to a given density field. Specifically, the following three technical contributions are made. First, to make the quadrangulation align accurately with feature curves or surface boundary curves, we introduce novel boundary conditions for wave-like functions that satisfy the Helmholtz equation approximately in the least squares sense. Such functions, called quasi-eigenfunctions, are computed efficiently as the solutions to a variational problem. Second, the mesh element size is effectively controlled by locally modulating the Laplace operator in the Helmholtz equation according to a given density field. Third, to improve robustness, we propose a novel scheme to minimize the vibration difference of the quasi-eigenfunction in two orthogonal directions. It is demonstrated by extensive experiments that our method outperforms previous methods in generating feature-aligned quadrilateral meshes with tight control of local elememt size. We further present some preliminary results to show that our method can be extended to generating hex-dominant volume meshes.

[1]  Hujun Bao,et al.  Spectral Quadrangulation with Feature Curve Alignment and Element Size Control , 2014, ACM Trans. Graph..

[2]  Herbert Edelsbrunner,et al.  Hierarchical Morse—Smale Complexes for Piecewise Linear 2-Manifolds , 2003, Discret. Comput. Geom..

[3]  Konrad Polthier,et al.  QuadCover ‐ Surface Parameterization using Branched Coverings , 2007, Comput. Graph. Forum.

[4]  Timothy A. Davis,et al.  Algorithm 832: UMFPACK V4.3---an unsymmetric-pattern multifrontal method , 2004, TOMS.

[5]  Pierre Alliez,et al.  Interleaving Delaunay refinement and optimization for practical isotropic tetrahedron mesh generation , 2009, ACM Trans. Graph..

[6]  Loïc Maréchal,et al.  Advances in Octree-Based All-Hexahedral Mesh Generation: Handling Sharp Features , 2009, IMR.

[7]  Valerio Pascucci,et al.  Spectral surface quadrangulation , 2006, SIGGRAPH '06.

[8]  Michael Garland,et al.  Fair morse functions for extracting the topological structure of a surface mesh , 2004, ACM Trans. Graph..

[9]  John Hart,et al.  ACM Transactions on Graphics , 2004, SIGGRAPH 2004.

[10]  Bruno Lévy,et al.  Mesh parameterization: theory and practice , 2007, SIGGRAPH Courses.

[11]  Pierre Alliez,et al.  Periodic global parameterization , 2006, TOGS.

[12]  Cláudio T. Silva,et al.  State of the Art in Quad Meshing , 2012 .

[13]  Hujun Bao,et al.  Spectral quadrangulation with orientation and alignment control , 2008, SIGGRAPH Asia '08.

[14]  Pierre Alliez,et al.  Anisotropic polygonal remeshing , 2003, ACM Trans. Graph..

[15]  Hujun Bao,et al.  A wave-based anisotropic quadrangulation method , 2010, ACM Trans. Graph..

[16]  Bernd Hamann,et al.  Practical Considerations in Morse-Smale Complex Computation , 2011, Topological Methods in Data Analysis and Visualization.

[17]  Leif Kobbelt,et al.  A Robust Two‐Step Procedure for Quad‐Dominant Remeshing , 2006, Comput. Graph. Forum.

[18]  Bruno Lévy,et al.  Spectral Geometry Processing with Manifold Harmonics , 2008, Comput. Graph. Forum.

[19]  Mark Meyer,et al.  Discrete Differential-Geometry Operators for Triangulated 2-Manifolds , 2002, VisMath.

[20]  David Bommes,et al.  Mixed-integer quadrangulation , 2009, SIGGRAPH '09.

[21]  David Bommes,et al.  Dual loops meshing , 2012, ACM Trans. Graph..

[22]  Denis Zorin,et al.  Anisotropic quadrangulation , 2010, SPM '10.

[23]  Dong-Ming Yan,et al.  Isotropic Remeshing with Fast and Exact Computation of Restricted Voronoi Diagram , 2009, Comput. Graph. Forum.

[24]  YANQING CHEN,et al.  Algorithm 8 xx : CHOLMOD , supernodal sparse Cholesky factorization and update / downdate ∗ , 2006 .

[25]  Pierre Alliez,et al.  Isotropic 2D Quadrangle Meshing with Size and Orientation Control , 2011, IMR.

[26]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[27]  Baining Guo,et al.  All-hex meshing using singularity-restricted field , 2012, ACM Trans. Graph..

[28]  Daniele Panozzo,et al.  Simple quad domains for field aligned mesh parametrization , 2011, ACM Trans. Graph..

[29]  Pierre Alliez,et al.  Designing quadrangulations with discrete harmonic forms , 2006, SGP '06.

[30]  Brian Wyvill,et al.  Interactive decal compositing with discrete exponential maps , 2006, ACM Trans. Graph..

[31]  Ulrich Pinkall,et al.  Computing Discrete Minimal Surfaces and Their Conjugates , 1993, Exp. Math..

[32]  Yalin Wang,et al.  Volumetric Harmonic Map , 2003, Commun. Inf. Syst..

[33]  Hujun Bao,et al.  Boundary aligned smooth 3D cross-frame field , 2011, ACM Trans. Graph..

[34]  Konrad Polthier,et al.  CUBECOVER – Parameterization of 3D Volumes , 2011 .

[35]  Wenping Wang,et al.  Shape optimization of quad mesh elements , 2011, Comput. Graph..

[36]  Michael Garland,et al.  Harmonic functions for quadrilateral remeshing of arbitrary manifolds , 2005, Comput. Aided Geom. Des..

[37]  Eitan Grinspun,et al.  Discrete laplace operators: no free lunch , 2007, Symposium on Geometry Processing.

[38]  Matthew L. Staten,et al.  Unconstrained Paving & Plastering: A New Idea for All Hexahedral Mesh Generation , 2005, IMR.

[39]  Bernd Hamann,et al.  Efficient Computation of Morse-Smale Complexes for Three-dimensional Scalar Functions , 2007, IEEE Transactions on Visualization and Computer Graphics.

[40]  Eugene Zhang,et al.  All‐Hex Mesh Generation via Volumetric PolyCube Deformation , 2011, Comput. Graph. Forum.

[41]  Daniela Giorgi,et al.  Discrete Laplace-Beltrami operators for shape analysis and segmentation , 2009, Comput. Graph..