Jaal: Engineering a High Quality All-Quadrilateral Mesh Generator

In this paper, we describe the implementation of an open source code (Jaal) for producing a high quality, isotropic all-quadrilateral mesh for an arbitrary complex surface geometry. Two basic steps in this process are: (1) Triangle to quad mesh conversion using Suneeta Ramaswamy’s tree matching algorithm and (2) Global mesh cleanup operation using Guy Bunin’s one-defect remeshing to reduce irregular nodes in the mesh.

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

[2]  David Eppstein,et al.  Quadrilateral Meshing by Circle Packing , 1999, Int. J. Comput. Geom. Appl..

[3]  David Bommes,et al.  Global Structure Optimization of Quadrilateral Meshes , 2011, Comput. Graph. Forum.

[4]  Matthew L. Staten,et al.  POST REFINEMENT ELEMENT SHAPE IMPROVEMENT FOR QUADRILATERAL MESHES , 2007 .

[5]  Cláudio T. Silva,et al.  Template-based quadrilateral meshing , 2011, Comput. Graph..

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

[7]  Matthew L. Staten,et al.  Advancing Front Quadrilateral Meshing Using Triangle Transformations , 1998, IMR.

[8]  L. Chew,et al.  Using Transactions in Delaunay Mesh Generation , 2006 .

[9]  Steven E. Benzley,et al.  Automated Quadrilateral Coarsening by Ring Collapse , 2008, IMR.

[10]  P. Knupp.  Achieving finite element mesh quality via optimization of the jacobian matrix norm and associated qu , 2000 .

[11]  Detlef Seese,et al.  Easy Problems for Tree-Decomposable Graphs , 1991, J. Algorithms.

[12]  Guy Bunin,et al.  Non-Local Topological Clean-Up , 2006, IMR.

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

[14]  Piotr Sankowski,et al.  Maximum matchings in planar graphs via gaussian elimination , 2004, Algorithmica.

[15]  Godfried T. Toussaint,et al.  Converting triangulations to quadrangulations , 1998, Comput. Geom..

[16]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

[17]  F. Betul Atalay,et al.  Quadrilateral meshes with provable angle bounds , 2011, Engineering with Computers.

[18]  S. Canann,et al.  Topological improvement procedures for quadrilateral finite element meshes , 1998, Engineering with Computers.

[19]  Paul Kinney,et al.  “CleanUp: Improving Quadrilateral Finite Element Meshes” , 2008 .

[20]  Stefan Arnborg,et al.  Problems Easy for Tree-Decomposable Graphs (Extended Abstract) , 1988, ICALP.

[21]  Kenji Shimada,et al.  An Angle-Based Approach to Two-Dimensional Mesh Smoothing , 2000, IMR.

[22]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[23]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).