We use circle-packing methods to generate quadrilateral meshes for polygona
l domains, with guaranteed bounds both on the quality and the number of ele
ments. We show that these methods can generate meshes of several types: (1)
the elements form the cells of a Voronoi diagram, (2) all elements have tw
o opposite 90 degrees angles, (3) all elements are kites, or (4) all angles
are at most 120 degrees. In each case the total number of elements is O(n)
, where n is the number of input vertices.