|
|||||
|
|
A framework and algorithms for circular drawings of graphs |
|
| Authors: | Janet M. Six Ioannis G. Tollis |
| Affiliation: | aLone Star Interaction Design, PO Box 1993, Wylie, TX 75098, USA;bDepartment of Computer Science, University of Crete, GR 714 09 Heraklion, Greece;cInstitute of Computer Science, Foundation for Research and Technology Hellas-FORTH, PO Box 1385, 71110 Heraklion, Crete, Greece |
| Abstract: | In this paper, we present a framework and two linear time algorithms for obtaining circular drawings of graphs. The first technique produces circular drawings of biconnected graphs and finds a zero crossing circular drawing if one exists. The second technique finds multiple embedding circle drawings. Techniques for the reduction of edge crossings are also discussed. Results of experimental studies are included. |
| Keywords: | Circular graph drawing Graph drawing Information visualization Network visualization Clustered views Minimization of crossings Experimental studies |
| 本文献已被 ScienceDirect 等数据库收录！ | |