B. Ibrahim, Honitriniela Randriamparany, Hidenori Yoshizumi
{"title":"基于图形的视觉语言中边缘绘制的启发式方法","authors":"B. Ibrahim, Honitriniela Randriamparany, Hidenori Yoshizumi","doi":"10.1109/HCC.2001.995284","DOIUrl":null,"url":null,"abstract":"Control-flow diagrams are often criticized as difficult to read because of numerous edge intersections. To improve the readability we propose a solution that manages the visual complexity of graphs with hundreds, or even thousands of nodes. It consists in applying heuristics to choose the best path for an edge and an appropriate color that will help distinguish an edge from its neighbors.","PeriodicalId":438014,"journal":{"name":"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Heuristics for edge drawing in a graph-based visual language\",\"authors\":\"B. Ibrahim, Honitriniela Randriamparany, Hidenori Yoshizumi\",\"doi\":\"10.1109/HCC.2001.995284\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Control-flow diagrams are often criticized as difficult to read because of numerous edge intersections. To improve the readability we propose a solution that manages the visual complexity of graphs with hundreds, or even thousands of nodes. It consists in applying heuristics to choose the best path for an edge and an appropriate color that will help distinguish an edge from its neighbors.\",\"PeriodicalId\":438014,\"journal\":{\"name\":\"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/HCC.2001.995284\",\"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 IEEE Symposia on Human-Centric Computing Languages and Environments (Cat. No.01TH8587)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/HCC.2001.995284","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Heuristics for edge drawing in a graph-based visual language
Control-flow diagrams are often criticized as difficult to read because of numerous edge intersections. To improve the readability we propose a solution that manages the visual complexity of graphs with hundreds, or even thousands of nodes. It consists in applying heuristics to choose the best path for an edge and an appropriate color that will help distinguish an edge from its neighbors.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
