In this paper we present a new algorithm that constructs an orthogonal drawing of a graph G with degree at most three. Even if we do not require any limitations neither to planar nor to biconnected graphs, we reach the best known results in the literarture: each edge has at most 1 bend, the total number of bends is less than or equal to n/2 + 1, and the area is less than or equal to (n/2-1)(2).
An efficient orthogonal grid drawing algorithm for cubic graphs / Calamoneri, Tiziana; Petreschi, Rossella. - 959:(1995), pp. 31-40. (Intervento presentato al convegno 1st Annual International Computing and Combinatorics Conference (COCOON 95) tenutosi a XIAN, PEOPLES R CHINA nel AUG 24-26, 1995) [10.1007/bfb0030817].
An efficient orthogonal grid drawing algorithm for cubic graphs
CALAMONERI, Tiziana;PETRESCHI, Rossella
1995
Abstract
In this paper we present a new algorithm that constructs an orthogonal drawing of a graph G with degree at most three. Even if we do not require any limitations neither to planar nor to biconnected graphs, we reach the best known results in the literarture: each edge has at most 1 bend, the total number of bends is less than or equal to n/2 + 1, and the area is less than or equal to (n/2-1)(2).I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
