Quadrilateral meshes with bounded minimum angle

In this paper, we present an algorithm that utilizes a quadtree data structure to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly created angle is smaller than 18.43◦ (= arctan(1 3 )). This is the first known result, to the best of our knowledge, on quadrilateral mesh generation with a provable guarantee on the minimum angle.

• Type: Conference
• Year: 2009
• Where: COMPGEOM
• Authors: Scott Hine, F. Betul Atalay, Dianna Xu, Suneeta Ramaswami
• Keywords: COMPGEOM 2009, Convex Quadrilateral Mesh, Discrete Geometry, Quadrilateral Mesh, Quadrilateral Mesh Generation