DeepAI
Log In Sign Up

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

page 1

page 2

page 3

page 4

08/30/2022

Unit-length Rectangular Drawings of Graphs

A rectangular drawing of a planar graph G is a planar drawing of G in wh...
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...
07/06/2022

Multi-area Target Individual Detection with Free Drawing on Video

This paper has provided a novel design idea and some implementation meth...
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/30/2018

β-Stars or On Extending a Drawing of a Connected Subgraph

We consider the problem of extending the drawing of a subgraph of a give...
08/30/2018

Algorithms and Bounds for Drawing Directed Graphs

In this paper we present a new approach to visualize directed graphs and...