pith. sign in

arxiv: 1702.05265 · v1 · pith:KWMH7SP5new · submitted 2017-02-17 · 💻 cs.CG

T-Shape Visibility Representations of 1-Planar Graphs

classification 💻 cs.CG
keywords graphvisibilityplanarrepresentationedgeeveryflathorizontal
0
0 comments X
read the original abstract

A shape visibility representation displays a graph so that each vertex is represented by an orthogonal polygon of a particular shape and for each edge there is a horizontal or vertical line of sight between the polygons assigned to its endvertices. Special shapes are rectangles, L, T, E and H-shapes, and caterpillars. A flat rectangle is a horizontal bar of height $\epsilon>0$. A graph is 1-planar if there is a drawing in the plane such that each edge is crossed at most once and is IC-planar if in addition no two crossing edges share a vertex. We show that every IC-planar graph has a flat rectangle visibility representation and that every 1-planar graph has a T-shape visibility representation. The representations use quadratic area and can be computed in linear time from a given embedding.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.