We prove that every planar straight line graph with n vertices has a
con...
We show that any planar straight line graph (PSLG) with n vertices has a...
We show that any simple planar n-gon can be meshed in linear time by O(n...
Given any ϵ >0 and any planar region Ω bounded by a simple
n-gon P we co...