کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
524413 868644 2014 11 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Techniques for Edge Stratification of Complex Graph Drawings
ترجمه فارسی عنوان
تکنیک های ترسیم لبه های نمودارهای مجتمع گراف
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نرم افزارهای علوم کامپیوتر
چکیده انگلیسی


• We propose a new approach to explore a layout produced by any graph drawing algorithm.
• We define an edge stratification model and the related optimization problems.
• We give a general framework to solve these problems for several layers׳ properties.
• We present the results of a user study to test the effectiveness of our approach.
• An experimental analysis to see how many layers force-directed algorithms produce.

We propose an approach that allows a user (e.g., an analyst) to explore a layout produced by any graph drawing algorithm, in order to reduce the visual complexity and clarify its presentation. Our approach is based on stratifying the drawing into layers with desired properties; to this aim, heuristics are presented. The produced layers can be explored and combined by the user to gradually acquire details. We present a user study to test the effectiveness of our approach. Furthermore, we performed an experimental analysis on popular force-directed graph drawing algorithms, in order to evaluate what is the algorithm that produces the smallest number of layers and if there is any correlation between the number of crossings and the number of layers of a graph layout. The proposed approach is useful to explore graph layouts, as confirmed by the presented user study. Furthermore, interesting considerations arise from the experimental evaluation, in particular, our results suggest that the number of layers of a graph layout may represent a reliable measure of its visual complexity. The algorithms presented in this paper can be effectively applied to graph layouts with a few hundreds of edges and vertices. For larger drawings that contain lots of crossings, the time complexity of our algorithms grows quadratically in the number of edges and more efficient techniques need to be devised. The proposed approach takes as input a layout produced by any graph drawing algorithm, therefore it can be applied in a variety of application domains. Several research directions can be explored to extend our framework and to devise new visualization paradigms to effectively present stratified drawings.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Visual Languages & Computing - Volume 25, Issue 4, August 2014, Pages 533–543
نویسندگان
, , , , ,