Proceedings of the 17th International Meshing Roundtable
Final Published Version
This paper presents an algorithm that utilizes a quadtree to construct a strictly convex quadrilateral mesh for a simple polygonal region in which no newly created angle is smaller than . This is the first known result, to the best of our knowledge, on quadrilateral mesh generation with a provable guarantee on the minimum angle.
Copyright 2008 Springer Verlag. The published version of this article can be found here: http://doi.org/10.1007/978-3-540-87921-3_5
Atalay, F.B. et al. 2008. Quadrilateral Meshes with Bounded Minimum Angle. In R.V. Garimella (ed.), Proceedings of the 17th International Meshing Roundtable, Berlin: 73-91.