在图中可视化加权边

P. Rodgers, P. Mutton
{"title":"在图中可视化加权边","authors":"P. Rodgers, P. Mutton","doi":"10.1109/IV.2003.1217988","DOIUrl":null,"url":null,"abstract":"We introduce a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing Web page similarity data.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"323 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Visualizing weighted edges in graphs\",\"authors\":\"P. Rodgers, P. Mutton\",\"doi\":\"10.1109/IV.2003.1217988\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing Web page similarity data.\",\"PeriodicalId\":259374,\"journal\":{\"name\":\"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.\",\"volume\":\"323 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IV.2003.1217988\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2003.1217988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

我们引入了一种新的边长度启发式算法,它可以找到一个边长度与图边上的权重成正比的图布局。该启发式可以与弹簧嵌入器结合使用,以产生具有精确表示边缘长度的图和具有良好的一般可理解性的图之间的折衷。我们描述了结合这两种方法的初步研究,以便用户可以调整他们的偏好,并演示系统在随机生成的图形和表示Web页面相似度数据的图形上的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Visualizing weighted edges in graphs
We introduce a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing Web page similarity data.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信