Let P be a set of points in the plane and S a set of non-crossing line segments with endpoints in P. The visibility graph of P with respect to S, denoted , has vertex set P and an edge for each pair of vertices u,v in P for which no line segment of S properly intersects uv. We show that the constrained half-θ 6-graph (which is identical to the constrained Delaunay graph whose empty visible region is an equilateral triangle) is a plane 2-spanner of . We then show how to construct a plane 6-spanner of with maximum degree 6+c, where c is the maximum number of segments adjacent to a vertex. © 2012 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Bose, P., Fagerberg, R., Van Renssen, A., & Verdonschot, S. (2012). On plane constrained bounded-degree spanners. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7256 LNCS, pp. 85–96). https://doi.org/10.1007/978-3-642-29344-3_8
Mendeley helps you to discover research relevant for your work.