Quadrilateral meshes for PSLGs

Abstract

We prove that every planar straight line graph with $n$ vertices has a conforming quadrilateral mesh with $O(n^2)$ elements, all angles $\le 120^{\circ }$ and all new angles $\ge 60^{\circ }$. Both the complexity and the angle bounds are sharp. Moreover, all but $O(n)$ of the angles may be taken in a smaller interval, say $[89^{\circ },91^{\circ }]$.

55 pages, 39 figures

References in corpus (2)

• Conformal mapping in linear time
• Nonobtuse triangulations of PSLGs

Cited by in corpus (1)

• Nonobtuse triangulations of PSLGs