DeepAI
Log In Sign Up

On Turn-Regular Orthogonal Representations

08/20/2020
by   Michael A. Bekos, et al.
0

An interesting class of orthogonal representations consists of the so-called turn-regular ones, i.e., those that do not contain any pair of reflex corners that "point to each other" inside a face. For such a representation H it is possible to compute in linear time a minimum-area drawing, i.e., a drawing of minimum area over all possible assignments of vertex and bend coordinates of H. In contrast, finding a minimum-area drawing of H is NP-hard if H is non-turn-regular. This scenario naturally motivates the study of which graphs admit turn-regular orthogonal representations. In this paper we identify notable classes of biconnected planar graphs that always admit such representations, which can be computed in linear time. We also describe a linear-time testing algorithm for trees and provide a polynomial-time algorithm that tests whether a biconnected plane graph with "small" faces has a turn-regular orthogonal representation without bends.

READ FULL TEXT

page 1

page 2

page 3

page 4

05/16/2022

Computing Bend-Minimum Orthogonal Drawings of Plane Series-Parallel Graphs in Linear Time

A planar orthogonal drawing of a planar 4-graph G (i.e., a planar graph ...
10/10/2022

Parameterized Approaches to Orthogonal Compaction

Orthogonal graph drawings are used in applications such as UML diagrams,...
03/11/2021

Upward Planar Drawings with Three and More Slopes

We study upward planar straight-line drawings that use only a constant n...
08/24/2020

Extending Partial Orthogonal Drawings

We study the planar orthogonal drawing style within the framework of par...
06/05/2021

Upward planar drawings with two slopes

In an upward planar 2-slope drawing of a digraph, edges are drawn as str...
08/27/2018

Greedy Rectilinear Drawings

A drawing of a graph is greedy if for each ordered pair of vertices u an...
06/10/2021

A Topology-Shape-Metrics Framework for Ortho-Radial Graph Drawing

Orthogonal drawings, i.e., embeddings of graphs into grids, are a classi...