Outside-Obstacle Representations with All Vertices on the Outer Face

Authors

DOI:

https://doi.org/10.57717/cgt.v4i1.64

Abstract

An obstacle representation of a graph G consists of a set of polygonal obstacles and a drawing of G as a visibility graph with respect to the obstacles: vertices are mapped to points and edges to straight-line segments such that each edge avoids all obstacles whereas each non-edge intersects at least one obstacle. Obstacle representations have been investigated quite intensely over the last few years. Here we focus on outside-obstacle representations (OORs) that use only one obstacle in the outer face of the drawing. It is known that every outerplanar graph admits such a representation.

We strengthen this result by showing that every (partial) 2-tree has an OOR. We also consider restricted versions of OORs where the vertices of the graph form a convex or even a regular polygon. We characterize when the complement of a tree and when a complete graph minus a simple cycle admits a convex OOR. We construct regular OORs for all (partial) outerpaths, cactus graphs, and grids.

Downloads

Published

2025-02-10

How to Cite

Firman, O., Kindermann, P., Klawitter, J., Klemz, B., Klesen, F., & Wolff, A. (2025). Outside-Obstacle Representations with All Vertices on the Outer Face. Computing in Geometry and Topology, 4(1), 2:1–2:21. https://doi.org/10.57717/cgt.v4i1.64

Issue

Section

Original Research Articles

Categories