An improved force-directed graph layout algorithm based on aesthetic criteria
نویسندگان
چکیده
The force-directed graph layout algorithm is one of the most widely used algorithms for drawing graphs. It aims at improving the graphs’ readability and understanding by producing high-quality drawings. However, the traditional algorithm, while trying to find the most stable position for each vertex, fails to produce graphs that satisfy different aesthetic criteria. In this paper, we present an algorithm that concerns the number of edge crossings, angular resolution and crossing angles. These aesthetic criteria are chosen because they are closely related to human comprehension. In addition, we also introduce a refinement process by applying a curved edges drawing method to further improve the angular resolution, which can also beautify the final drawing. The experimental results have shown that our approach can produce graphs in a more aesthetically pleasing way with larger angular resolution, proper crossing angles and less edge crossings.
منابع مشابه
Neighborhood beautification Graph layout through message passing
Graph layout algorithms are used to compute aesthetic and useful visualizations of graphs. In general, for graphs with up to a few hundred nodes, force-directed layout algorithms produce good layouts. Unfortunately, for larger graphs, they often get stuck at local minima and have high computational complexity. In this paper, we introduce a novel message passing technique for graph layout. The k...
متن کاملAesthetics of Class Diagrams
Visualization of object-oriented programs by class diagrams is a widely used technique. So far no commonly agreed aesthetic criteria have been recorded in order to standardize and measure the quality of class diagrams. In this paper we focus on UML class diagrams, the standard notation for class diagrams in software engineering. We propose some aesthetic criteria which reflect the highly sophis...
متن کاملUsing Spring Algorithms to Remove Node Overlapping
Cluttered drawings of graphs cannot effectively convey the information of graphs. Two issues might cause node overlapping when one draws a picture of a graph. The first issue occurs when applying a layout algorithm for an abstract graph to a practical application in which nodes are labeled. The second is the changing of a node’s size in a dynamic drawing system. This paper presents two algorith...
متن کاملOn the Generalized Box-Drawing of Trees —Survey and New Technology—
This paper is on the aesthetic layout of n-ary trees with nodes of variable size, also referred to as generalized box-drawing. For this layout problem a few algorithms have been proposed, which differ in their runtime performance and the attained aesthetic criteria. We introduce a new approach to this layout problem, which is interesting because of both its simplicity and elegance, and which em...
متن کاملGraph Layout with Versatile Boundary Constraints
Graph layouts are in general data dependent and help to reveal structural and attribute relationships in the data set. However, there are situations when one may wish to alter the layout e.g. to emphasize parts of the data set or for aesthetic reasons. This paper strives to meet that need for the case of force-directed graph layout algorithms. Our approach is to add boundary constraints to spec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computat. and Visualiz. in Science
دوره 16 شماره
صفحات -
تاریخ انتشار 2013