聚类相交图的力定向绘制方法

H. Omote, Kozo Sugiyama
{"title":"聚类相交图的力定向绘制方法","authors":"H. Omote, Kozo Sugiyama","doi":"10.1109/APVIS.2007.329280","DOIUrl":null,"url":null,"abstract":"We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, aesthetics, model, algorithm, performance evaluation, and applications.","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":"15","resultStr":"{\"title\":\"Force-directed drawing method for intersecting clustered graphs\",\"authors\":\"H. Omote, Kozo Sugiyama\",\"doi\":\"10.1109/APVIS.2007.329280\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, aesthetics, model, algorithm, performance evaluation, and applications.\",\"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\":\"15\",\"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.329280\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 6th International Asia-Pacific Symposium on Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APVIS.2007.329280","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 15

摘要

提出了一种新的绘制相交聚类图的力定向方法。这是基于虚拟物理系统的模拟。图可以表达复杂的结构,如顶点/聚类之间的包含和相交,以及邻接关系,它被用于多种领域,如创意支持,软件工程,语义Web。我们描述了定义、美学、模型、算法、性能评估和应用。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Force-directed drawing method for intersecting clustered graphs
We present a novel force-directed method for drawing an intersecting clustered graph. This is based upon simulation of a virtual physical system. The graph can express complicated structures such as inclusion and intersection between vertices/clusters as well as adjacency, and it is used in diverse fields such as creativity support, software engineering, and semantic Web. We describe definitions, aesthetics, model, algorithm, performance evaluation, and applications.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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