View : 18 Download: 0

Drawing series parallel digraphs symmetrically

Title
Drawing series parallel digraphs symmetrically
Authors
Hong S.-H.Eades P.Lee S.-H.
Ewha Authors
이상호
SCOPUS Author ID
이상호scopus
Issue Date
2000
Journal Title
Computational Geometry: Theory and Applications
ISSN
0925-7721JCR Link
Citation
vol. 17, no. 3-4, pp. 165 - 188
Indexed
SCIE; SCOPUS WOS scopus
Abstract
In this paper we present algorithms for drawing series parallel digraphs with as much symmetry as possible. The first step is to compute a certain kind of automorphism, called an "upward planar automorphism" for an input series parallel digraph. The next step uses these automorphisms to construct a symmetric drawing of the graph. We present several variations of the second step, with visibility drawings, "bus-orthogonal" drawings, and polyline drawings. All algorithms run in linear time. © 2000 Elsevier Science B.V.
Appears in Collections:
엘텍공과대학 > 컴퓨터공학과 > Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE