NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
인공지능대학
컴퓨터공학과
Journal papers
View : 667 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
이상호
Issue Date
2000
Journal Title
Computational Geometry: Theory and Applications
ISSN
0925-7721
Citation
Computational Geometry: Theory and Applications vol. 17, no. 3-4, pp. 165 - 188
Indexed
SCIE; SCOPUS
Document Type
Article
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
Show full item record
Find@EWHA
트윗하기
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject