Analysis of a high-dimensional approach to interactive graph drawing

H. Hosobe
{"title":"Analysis of a high-dimensional approach to interactive graph drawing","authors":"H. Hosobe","doi":"10.1109/APVIS.2007.329281","DOIUrl":null,"url":null,"abstract":"Graph drawing is an information visualization technology for illustrating relations between objects. Interactive graph drawing is often important since it is difficult to statically lay out complex graphs. For the interactive drawing of general undirected graphs, we have proposed the high-dimensional approach, which uses static graph layouts in high-dimensional spaces to dynamically find two-dimensional layouts according to user interaction. Although the resulting interactive graph drawing method was found to be fast, other properties of it are not yet clear. In this paper, we analyze the high-dimensional approach to further explore its properties. Specifically, we perform the following two kinds of its analysis: (1) sensitivity analysis for investigating how the high-dimensional approach places graph nodes on the two-dimensional plane; (2) empirical analysis for examining the appropriateness of underlying graph layout methods. The results show that, as an underlying graph layout method, Kruskal and Seery's method based on Torgerson's multidimensional scaling method is more appropriate for the high-dimensional approach than other methods for computing graph layouts in high-dimensional spaces.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 6th International Asia-Pacific Symposium on Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APVIS.2007.329281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Graph drawing is an information visualization technology for illustrating relations between objects. Interactive graph drawing is often important since it is difficult to statically lay out complex graphs. For the interactive drawing of general undirected graphs, we have proposed the high-dimensional approach, which uses static graph layouts in high-dimensional spaces to dynamically find two-dimensional layouts according to user interaction. Although the resulting interactive graph drawing method was found to be fast, other properties of it are not yet clear. In this paper, we analyze the high-dimensional approach to further explore its properties. Specifically, we perform the following two kinds of its analysis: (1) sensitivity analysis for investigating how the high-dimensional approach places graph nodes on the two-dimensional plane; (2) empirical analysis for examining the appropriateness of underlying graph layout methods. The results show that, as an underlying graph layout method, Kruskal and Seery's method based on Torgerson's multidimensional scaling method is more appropriate for the high-dimensional approach than other methods for computing graph layouts in high-dimensional spaces.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种高维交互式图形绘制方法的分析
图形绘制是一种用于表示对象之间关系的信息可视化技术。交互式图形绘制通常很重要,因为很难静态地布局复杂的图形。对于一般无向图的交互绘制,我们提出了高维方法,利用高维空间中的静态图形布局,根据用户交互动态寻找二维布局。虽然由此产生的交互式图形绘制方法被发现是快速的,但它的其他性质尚不清楚。本文通过对高维方法的分析,进一步探讨其性质。具体来说,我们对其进行了以下两种分析:(1)灵敏度分析,研究高维方法如何将图节点放置在二维平面上;(2)实证分析检验底层图布局方法的适宜性。结果表明,作为一种底层图布局方法,基于Torgerson多维标度法的Kruskal和Seery方法比其他方法更适合于高维空间的图布局计算。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Visualization and analysis of email networks Particle-based volume rendering A comparison of vertex ordering algorithms for large graph visualization Straight-line grid drawings of planar graphs with linear area Force-directed drawing method for intersecting clustered graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1