Skip to main content
We gratefully acknowledge support from the Simons Foundation, member institutions, and all contributors. Donate
arXiv logo
Cornell University Logo

Computer Science > Data Structures and Algorithms

arXiv:1009.2109 (cs)
[Submitted on 10 Sep 2010 (v1), last revised 27 Sep 2010 (this version, v2)]

Title:Maximizing the Total Resolution of Graphs

Authors:Evmorfia N. Argyriou, Michael A. Bekos, Antonios Symvonis
View PDF
Abstract:A major factor affecting the readability of a graph drawing is its resolution. In the graph drawing literature, the resolution of a drawing is either measured based on the angles formed by consecutive edges incident to a common node (angular resolution) or by the angles formed at edge crossings (crossing resolution). In this paper, we evaluate both by introducing the notion of "total resolution", that is, the minimum of the angular and crossing resolution. To the best of our knowledge, this is the first time where the problem of maximizing the total resolution of a drawing is studied.
The main contribution of the paper consists of drawings of asymptotically optimal total resolution for complete graphs (circular drawings) and for complete bipartite graphs (2-layered drawings). In addition, we present and experimentally evaluate a force-directed based algorithm that constructs drawings of large total resolution.
Subjects: Data Structures and Algorithms (cs.DS)
Cite as: arXiv:1009.2109 [cs.DS]
  (or arXiv:1009.2109v2 [cs.DS] for this version)
  https://doi.org/10.48550/arXiv.1009.2109

Submission history

From: Antonios Symvonis [view email]
[v1] Fri, 10 Sep 2010 21:46:39 UTC (654 KB)
[v2] Mon, 27 Sep 2010 10:30:19 UTC (654 KB)
Full-text links:

Access Paper:

view license
Current browse context:
cs.DS
< prev   |   next >
new | recent | 2010-09
Change to browse by:
cs

References & Citations

DBLP - CS Bibliography

listing | bibtex
Evmorfia Argyriou
Evmorfia N. Argyriou
Michael A. Bekos
Antonios Symvonis
export BibTeX citation

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)