Drawing planar graphs with few segments on a polynomial grid

03/20/2019
by   Philipp Kindermann, et al.
0

The visual complexity of a plane graph drawing is defined to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represent multiple edges (e.g., one needs only one line segment to draw a path with an arbitrary number of edges). A crossing-free straight-line drawing of a graph is called monotone if there is a monotone path between any pair of vertices with respect to some direction. We study drawings of trees, outerplanar graphs, and general planar graphs with few segments on a polynomial size grid. For trees, the grid size is n× n. For 3-connected planar graphs and biconnected outerplanar graphs, we compute such drawings that are also monotone.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/31/2017

Experimental analysis of the accessibility of drawings with few segments

The visual complexity of a graph drawing is defined as the number of geo...
research
08/31/2017

Simple Compact Monotone Tree Drawings

A monotone drawing of a graph G is a straight-line drawing of G such tha...
research
08/21/2018

Monotone Drawings of k-Inner Planar Graphs

A k-inner planar graph is a planar graph that has a plane drawing with a...
research
10/16/2018

Segment representations with small resolution

A segment representation of a graph is an assignment of line segments in...
research
08/23/2019

Variants of the Segment Number of a Graph

The segment number of a planar graph is the smallest number of line segm...
research
09/06/2023

CelticGraph: Drawing Graphs as Celtic Knots and Links

Celtic knots are an ancient art form often attributed to Celtic cultures...
research
09/06/2021

Minimum Number of Bends of Paths of Trees in a Grid Embedding

We are interested in embedding trees T with maximum degree at most four ...

Please sign up or login with your details

Forgot password? Click here to reset