Monotone Drawings of k-Inner Planar Graphs

08/21/2018
by   Anargyros Oikonomou, et al.
0

A k-inner planar graph is a planar graph that has a plane drawing with at most k internal vertices, i.e., vertices that do not lie on the boundary of the outer face of its drawing. An outerplanar graph is a 0-inner planar graph. In this paper, we show how to construct a monotone drawing of a k-inner planar graph on a 2(k+1)n × 2(k+1)n grid. In the special case of an outerplanar graph, we can produce a planar monotone drawing on a n × n grid, improving previously known results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/20/2019

Drawing planar graphs with few segments on a polynomial grid

The visual complexity of a plane graph drawing is defined to be the numb...
research
02/19/2018

The Complexity of Drawing a Graph in a Polygonal Region

We prove that the following problem is complete for the existential theo...
research
08/14/2019

On Strict (Outer-)Confluent Graphs

A strict confluent (SC) graph drawing is a drawing of a graph with verti...
research
02/19/2018

Convexity-Increasing Morphs of Planar Graphs

We study the problem of convexifying drawings of planar graphs. Given an...
research
05/30/2023

A Schnyder-type drawing algorithm for 5-connected triangulations

We define some Schnyder-type combinatorial structures on a class of plan...
research
07/20/2023

Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs

We study methods to manipulate weights in stress-graph embeddings to imp...
research
08/24/2017

Ordered Level Planarity, Geodesic Planarity and Bi-Monotonicity

We introduce and study the problem Ordered Level Planarity which asks fo...

Please sign up or login with your details

Forgot password? Click here to reset