# Bounded-Degree Spanners in the Presence of Polygonal Obstacles

Let V be a finite set of vertices in the plane and S be a finite set of polygonal obstacles, where the vertices of S are in V. We show how to construct a plane 2-spanner of the visibility graph of V with respect to S. As this graph can have unbounded degree, we modify it in three easy-to-follow steps, in order to bound the degree to 7 at the cost of slightly increasing the spanning ratio to 6.

Comments

There are no comments yet.

## Authors

• 17 publications
• 1 publication
• ### Routing on the Visibility Graph

We consider the problem of routing on a network in the presence of line ...
03/08/2018 ∙ by Prosenjit Bose, et al. ∙ 0

read it

• ### Computing the obstacle number of a plane graph

An obstacle representation of a plane graph G is V(G) together with a se...
07/22/2011 ∙ by Matthew P. Johnson, et al. ∙ 0

read it

• ### Reducing the maximum degree of a graph: comparisons of bounds

Let λ(G) be the smallest number of vertices that can be removed from a n...
07/17/2020 ∙ by Peter Borg, et al. ∙ 0

read it

• ### Recognizing Visibility Graphs of Triangulated Irregular Networks

A Triangulated Irregular Network (TIN) is a data structure that is usual...
01/24/2021 ∙ by Hossein Boomari Mojtaba Ostovari Alireza Zarei, et al. ∙ 0

read it

• ### Visibility Polygons and Visibility Graphs among Dynamic Polygonal Obstacles in the Plane

We devise an algorithm for maintaining the visibility polygon of any que...
11/19/2020 ∙ by Sanjana Agrwal, et al. ∙ 0

read it

• ### On the enumeration of plane bipolar posets and transversal structures

We show that plane bipolar posets (i.e., plane bipolar orientations with...
05/14/2021 ∙ by Éric Fusy, et al. ∙ 0

read it

• ### Finite degree clones are undecidable

A clone of functions on a finite domain determines and is determined by ...
11/13/2018 ∙ by Matthew Moore, et al. ∙ 0

read it

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.