紧凑UML序列图的自动布局和标签管理

C. Schulze, Gregor Hoops, R. V. Hanxleden
{"title":"紧凑UML序列图的自动布局和标签管理","authors":"C. Schulze, Gregor Hoops, R. V. Hanxleden","doi":"10.1109/VLHCC.2018.8506571","DOIUrl":null,"url":null,"abstract":"Sequence diagrams belong to the most commonly used UML diagrams. There is research on desirable aesthetics, but to our knowledge no layout algorithms have been published. This might be due to the rigid specification of sequence diagrams that seems to make laying them out quite easy. However, as we argue here, naive algorithms do not always produce desirable solutions. We present methods to produce compact layouts which we have implemented in a layout algorithm and evaluate them with 50 real-world sequence diagrams.","PeriodicalId":444336,"journal":{"name":"2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Automatic Layout and Label Management for Compact UML Sequence Diagrams\",\"authors\":\"C. Schulze, Gregor Hoops, R. V. Hanxleden\",\"doi\":\"10.1109/VLHCC.2018.8506571\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Sequence diagrams belong to the most commonly used UML diagrams. There is research on desirable aesthetics, but to our knowledge no layout algorithms have been published. This might be due to the rigid specification of sequence diagrams that seems to make laying them out quite easy. However, as we argue here, naive algorithms do not always produce desirable solutions. We present methods to produce compact layouts which we have implemented in a layout algorithm and evaluate them with 50 real-world sequence diagrams.\",\"PeriodicalId\":444336,\"journal\":{\"name\":\"2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VLHCC.2018.8506571\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VLHCC.2018.8506571","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

序列图属于最常用的UML图。有关于理想美学的研究,但据我们所知,还没有发表布局算法。这可能是由于序列图的严格规范,似乎使它们的布局相当容易。然而,正如我们在这里讨论的那样,朴素算法并不总是产生理想的解决方案。我们提出了在布局算法中实现的紧凑布局的方法,并用50个真实世界的序列图对它们进行了评估。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Automatic Layout and Label Management for Compact UML Sequence Diagrams
Sequence diagrams belong to the most commonly used UML diagrams. There is research on desirable aesthetics, but to our knowledge no layout algorithms have been published. This might be due to the rigid specification of sequence diagrams that seems to make laying them out quite easy. However, as we argue here, naive algorithms do not always produce desirable solutions. We present methods to produce compact layouts which we have implemented in a layout algorithm and evaluate them with 50 real-world sequence diagrams.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信