On Generalized Diamond Spanners

Given a set P of points in the plane and a set L of non-crossing line segments whose endpoints are in P , a constrained plane geometric graph is a plane graph whose vertex set is P and whose edge set contains L. An edge e has the α-visible diamond property if one of the two isosceles triangles with base e and base angle α does not contain any points of P… CONTINUE READING