Skip to main content
Conference ProceedingsOPEN ACCESS

Radial drawings of graphs: Geometric constraints and trade-offs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2007) 4372 LNCS 355-366
DOI: 10.1007/978-3-540-70904-6_34
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper studies how to compute radial drawings of graphs by taking into account additional geometric constraints which correspond to typical aesthetic and semantic requirements for the visualization. The following requirements are considered: vertex centrality, edge crossings, curve complexity, and vertex radial distribution. Trade-offs among these requirements and efficient drawing algorithms are presented. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Di Giacomo, E., Didimo, W., & Liotta, G. (2007). Radial drawings of graphs: Geometric constraints and trade-offs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4372 LNCS, pp. 355–366). Springer Verlag. https://doi.org/10.1007/978-3-540-70904-6_34

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free