Curvilinear graph drawing using the force-directed method

42Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present a method for modifying a force-directed graph drawing algorithm into an algorithm for drawing graphs with curved lines. Our method is based on embedding control points as dummy vertices so that edges can be drawn as splines. Our experiments show that our method yields aesthetically pleasing curvilinear drawing with improved angular resolution. Applying our method to the GEM algorithm on the test suite of the "Rome Graphs" resulted in an average improvement of 46% in angular resolution and of almost 6% in edge crossings. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Finkel, B., & Tamassia, R. (2004). Curvilinear graph drawing using the force-directed method. In Lecture Notes in Computer Science (Vol. 3383, pp. 448–453). https://doi.org/10.1007/978-3-540-31843-9_46

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