𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Rectilinear drawings of graphs

✍ Scribed by Carsten Thomassen

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
314 KB
Volume
12
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

✦ Synopsis

We consider graphs drawn in the plane such that every edge crosses at most one other edge. We characterize, in terms of two forbidden subconfigurations, which of these graphs are equivalent to drawings such that all edges are straight line segments. As a consequence we obtain a complete characterization of the pairs of dual graphs that can be represented as geometric dual graphs such that all edges except one are straight line segments.

πŸ“œ SIMILAR VOLUMES

A circular-arc characterization of certa
A circular-arc characterization of certain rectilinear drawings
✍ S. K. Stueckle; B. L. Piazza; R. D. Ringeisen πŸ“‚ Article πŸ“… 1995 πŸ› John Wiley and Sons 🌐 English βš– 268 KB

## Abstract In this paper we give a construction that produces exactly those graphs having maximum rectilinear crossing number equal to the subthrackle bound. We then prove a theorem characterizing these graphs in terms of proper circular‐arc graphs. Β© 1996 John Wiley & Sons, Inc.

Monotone drawings of planar graphs
Monotone drawings of planar graphs
✍ JΓ‘nos Pach; GΓ©za TΓ³th πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 92 KB

## Abstract Let __G__ be a graph drawn in the plane so that its edges are represented by __x__‐monotone curves, any pair of which cross an even number of times. We show that __G__ can be redrawn in such a way that the __x__‐coordinates of the vertices remain unchanged and the edges become non‐cross

Box-Rectangular Drawings of Plane Graphs
Box-Rectangular Drawings of Plane Graphs
✍ Md.Saidur Rahman; Shin-ichi Nakano; Takao Nishizeki πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 413 KB

In this paper we introduce a new drawing style of a plane graph G called a box-rectangular drawing. It is defined to be a drawing of G on an integer grid such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal line segment or a vertical line segment, a

An algorithm for drawing planar graphs
An algorithm for drawing planar graphs
✍ Bor Plestenjak πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 382 KB πŸ‘ 2 views

A simple algorithm for drawing 3-connected planar graphs is presented. It is derived from the Fruchterman and Reingold spring embedding algorithm by deleting all repulsive forces and fixing vertices of an outer face. The algorithm is implemented in the system for manipulating discrete mathematical s