Sara Di Bartolomeo, Markus Wallinger, Martin Nöllenburg
{"title":"优化生物纤维网络布局中的楼梯图案","authors":"Sara Di Bartolomeo, Markus Wallinger, Martin Nöllenburg","doi":"10.1111/cgf.70139","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Biofabric is a novel method for network visualization, with promising potential to highlight specific network features. Recent studies emphasize the importance of staircase motifs — equivalent to fans or stars in node-link diagrams — within Biofabric. However, to effectively showcase these motifs, we need to formulate specialized layout algorithms. This paper introduces a method to compute optimal layouts for Biofabric, focusing on maximizing staircase formation. We present an Integer Linear Programming (ILP) model for this task and evaluate its performance in terms of scalability and output quality against a leading heuristic method, Degreecending. Our results demonstrate that the ILP approach identifies significantly more, and often longer, staircases compared to Degreecending, albeit with the trade-off of higher computation times. Our supplemental material, including a full copy of the paper, code, and results, is available on osf.io.</p>\n </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.9000,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70139","citationCount":"0","resultStr":"{\"title\":\"Optimizing Staircase Motifs in Biofabric Network Layouts\",\"authors\":\"Sara Di Bartolomeo, Markus Wallinger, Martin Nöllenburg\",\"doi\":\"10.1111/cgf.70139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div>\\n \\n <p>Biofabric is a novel method for network visualization, with promising potential to highlight specific network features. Recent studies emphasize the importance of staircase motifs — equivalent to fans or stars in node-link diagrams — within Biofabric. However, to effectively showcase these motifs, we need to formulate specialized layout algorithms. This paper introduces a method to compute optimal layouts for Biofabric, focusing on maximizing staircase formation. We present an Integer Linear Programming (ILP) model for this task and evaluate its performance in terms of scalability and output quality against a leading heuristic method, Degreecending. Our results demonstrate that the ILP approach identifies significantly more, and often longer, staircases compared to Degreecending, albeit with the trade-off of higher computation times. Our supplemental material, including a full copy of the paper, code, and results, is available on osf.io.</p>\\n </div>\",\"PeriodicalId\":10687,\"journal\":{\"name\":\"Computer Graphics Forum\",\"volume\":\"44 3\",\"pages\":\"\"},\"PeriodicalIF\":2.9000,\"publicationDate\":\"2025-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70139\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Graphics Forum\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://onlinelibrary.wiley.com/doi/10.1111/cgf.70139\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, SOFTWARE ENGINEERING\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics Forum","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/cgf.70139","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
Optimizing Staircase Motifs in Biofabric Network Layouts
Biofabric is a novel method for network visualization, with promising potential to highlight specific network features. Recent studies emphasize the importance of staircase motifs — equivalent to fans or stars in node-link diagrams — within Biofabric. However, to effectively showcase these motifs, we need to formulate specialized layout algorithms. This paper introduces a method to compute optimal layouts for Biofabric, focusing on maximizing staircase formation. We present an Integer Linear Programming (ILP) model for this task and evaluate its performance in terms of scalability and output quality against a leading heuristic method, Degreecending. Our results demonstrate that the ILP approach identifies significantly more, and often longer, staircases compared to Degreecending, albeit with the trade-off of higher computation times. Our supplemental material, including a full copy of the paper, code, and results, is available on osf.io.
期刊介绍:
Computer Graphics Forum is the official journal of Eurographics, published in cooperation with Wiley-Blackwell, and is a unique, international source of information for computer graphics professionals interested in graphics developments worldwide. It is now one of the leading journals for researchers, developers and users of computer graphics in both commercial and academic environments. The journal reports on the latest developments in the field throughout the world and covers all aspects of the theory, practice and application of computer graphics.