Log In Sign Up

Optimal Orthogonal Drawings of Planar 3-Graphs in Linear Time

by   Walter Didimo, et al.

A planar orthogonal drawing Γ of a planar graph G is a geometric representation of G such that the vertices are drawn as distinct points of the plane, the edges are drawn as chains of horizontal and vertical segments, and no two edges intersect except at their common end-points. A bend of Γ is a point of an edge where a horizontal and a vertical segment meet. Γ is bend-minimum if it has the minimum number of bends over all possible planar orthogonal drawings of G. This paper addresses a long standing, widely studied, open question: Given a planar 3-graph G (i.e., a planar graph with vertex degree at most three), what is the best computational upper bound to compute a bend-minimum planar orthogonal drawing of G in the variable embedding setting? In this setting the algorithm can choose among the exponentially many planar embeddings of G the one that leads to an orthogonal drawing with the minimum number of bends. We answer the question by describing an O(n)-time algorithm that computes a bend-minimum planar orthogonal drawing of G with at most one bend per edge, where n is the number of vertices of G. The existence of an orthogonal drawing algorithm that simultaneously minimizes the total number of bends and the number of bends per edge was previously unknown.


page 1

page 2

page 3

page 4


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 ...

Efficient Algorithms for Bend-minimum Orthogonal Drawings of Planar 3-Graphs

Let G be a planar 3-graph (i.e., a planar graph with vertex degree at mo...

Planar Confluent Orthogonal Drawings of 4-Modal Digraphs

In a planar confluent orthogonal drawing (PCOD) of a directed graph (dig...

Quasi-upward Planar Drawings with Minimum Curve Complexity

This paper studies the problem of computing quasi-upward planar drawings...

Optimally Guarding 2-Reflex Orthogonal Polyhedra by Reflex Edge Guards

We study the problem of guarding an orthogonal polyhedron having reflex ...

Optimal Morphs of Planar Orthogonal Drawings

We describe an algorithm that morphs between two planar orthogonal drawi...

Rollercoasters and Caterpillars

A rollercoaster is a sequence of real numbers for which every maximal co...