Computational geometry: an introduction
Computational geometry: an introduction
Telecommunications network design algorithms
Telecommunications network design algorithms
Algorithms for drawing graphs: an annotated bibliography
Computational Geometry: Theory and Applications
Graph drawing and information visualization
ACM Computing Surveys (CSUR) - Special issue: position statements on strategic directions in computing research
An experimental comparison of four graph drawing algorithms
Computational Geometry: Theory and Applications
Graph Drawing: Algorithms for the Visualization of Graphs
Graph Drawing: Algorithms for the Visualization of Graphs
Circular Layout in the Graph Layout Toolkit
GD '96 Proceedings of the Symposium on Graph Drawing
Graph Clustering 1: Circles of Cliques
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Drawing Telecommunication Networks
GD '94 Proceedings of the DIMACS International Workshop on Graph Drawing
Drawing graphs on a smartphone
GD'10 Proceedings of the 18th international conference on Graph drawing
Searching and visualizing brain networks in schizophrenia
ISBMDA'06 Proceedings of the 7th international conference on Biological and Medical Data Analysis
Crossing reduction in circular layouts
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
| Hi-index | 0.00 |
Many applications which would benefit from an accompanying circular graph drawing include tools which manipulate telecommunication, computer, and social networks. Previous research has produced solutions which are visually complex with respect to the number of crossings. In this paper we focus our attention on developing better and more efficient circular drawing algorithms. In particular we present an O(m2) algorithm which lays out a biconnected graph onto a single embedding circle. Furthermore, we can guarantee that if a zero crossing circular embedding exists for an input graph, then our algorithm will find it. Also, the results of extensive experiments conducted over a set of 10,328 biconnected graphs and show our technique to perform significantly better than the current technology.