非表示:
キーワード:
-
要旨:
Orthogonal drawings of graphs are highly accepted in practice. For planar
graphs with vertex degree of at most four, Tamassia gives a polynomial time
algorithm which computes a region preserving orthogonal grid embedding with the
minimum number of bends. However, the graphs arising in practical applications
rarely have bounded vertex degree. In order to cope with general planar
graphs, we introduce the quasi--orthogonal drawing model. In this model,
vertices are drawn on grid points, and edges follow the grid paths except around
vertices of high degree. Furthermore we present an extension of Tamassia's
algorithm that constructs quasi--orthogonal drawings. We compare the drawings
to those obtained using related approaches.
