One-Bend Drawings of Outerplanar Graphs Inside Simple Polygons

08/27/2021
by   Patrizio Angelini, et al.
0

We consider the problem of drawing an outerplanar graph with n vertices with at most one bend per edge if the outer face is already drawn as a simple polygon. We prove that it can be decided in O(nm) time if such a drawing exists, where m≤ n-3 is the number of interior edges. In the positive case, we can also compute such a drawing.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/16/2019

Extending simple drawings with one edge is hard

A simple drawing D(G) of a graph G = (V,E) is a drawing in which two edg...
01/22/2018

INKA: An Ink-based Model of Graph Visualization

Common quality metrics of graph drawing have been about the readability ...
06/21/2019

Multidimensional Dominance Drawings

Let G be a DAG with n vertices and m edges. Two vertices u,v are incompa...
08/06/2021

CFGConf: Supporting high level requirements for visualizing Control Flow Graphs

Control Flow Graphs (CFGs) are directed graphs that represent all possib...
12/29/2020

Logical indetermination coupling: a method to minimize drawing matches and its applications

While justifying that independence is a canonic coupling, the authors sh...
08/31/2017

Drawing bobbin lace graphs, or, Fundamental cycles for a subclass of periodic graphs

In this paper, we study a class of graph drawings that arise from bobbin...
08/24/2020

Layered Drawing of Undirected Graphs with Generalized Port Constraints

The aim of this research is a practical method to draw cable plans of co...
This week in AI

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