The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Partially drawn links in graph visualizations have been introduced as a concept for further reducing visual clutter caused by many link crossings in combination to a formerly applied layout algorithm focusing on aesthetic graph drawing criteria. Although this visualization strategy has been shown to be useful for a faster and more accurate visual exploration of node-link diagrams in some scenarios,...
Exploring hierarchical organizations such as software systems is a challenging task. This gets even harder when these are large, deeply nested, and attached by a list of additional attributes of either quantitative, ordinal, or categorical nature. Tree maps have been designed to graphically represent such hierarchical structures in a space-filling way where two attributes for each hierarchy element...
The visualization of relational data by node-link diagrams quickly leads to a degradation of performance at some exploration tasks when the diagrams show visual clutter and overdraw. To address this challenge of large-data graph visualization, we introduce Graph Metric Views, a technique that enriches the visualization of traditional layout strategies for node-link diagrams by additionally allowing...
Graphs are a mathematical method to model relations between objects. The most common metaphor to visualize graphs is the node-link technique, which typically suffers from visual clutter caused by many edge crossings. Much research has been done on the development of sophisticated algorithms aimed at enhancing the layout with respect to edge crossings and a series of other aesthetic criteria. In this...
Most research on the readability of graph visualization focuses on node-link diagrams of static graphs. But in many applications graphs are not static, but change over time, or graphs are too dense to be drawn as node-link diagrams. In this paper we look at dynamic graph visualizations: We translate the general goal of graph visualization-to convey the underlying information of a graph-into aesthetic...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.