G. Battista, Ashim Garg, G. Liotta, A. Parise, R. Tamassia, Emanuele Tassinari, F. Vargiu, L. Vismara
{"title":"绘制有向无环图的实验研究","authors":"G. Battista, Ashim Garg, G. Liotta, A. Parise, R. Tamassia, Emanuele Tassinari, F. Vargiu, L. Vismara","doi":"10.1142/S0218195900000358","DOIUrl":null,"url":null,"abstract":"In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an experimental study on four drawing algorithms specifically developed for DAGs. Our study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and aspect ratio. The algorithms exhibit various trade-offs with respect to the quality measures, and none of them clearly outperforms the others.","PeriodicalId":285210,"journal":{"name":"International Journal of Computational Geometry and Applications","volume":"1631 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"38","resultStr":"{\"title\":\"Drawing Directed Acyclic Graphs: An Experimental Study\",\"authors\":\"G. Battista, Ashim Garg, G. Liotta, A. Parise, R. Tamassia, Emanuele Tassinari, F. Vargiu, L. Vismara\",\"doi\":\"10.1142/S0218195900000358\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an experimental study on four drawing algorithms specifically developed for DAGs. Our study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and aspect ratio. The algorithms exhibit various trade-offs with respect to the quality measures, and none of them clearly outperforms the others.\",\"PeriodicalId\":285210,\"journal\":{\"name\":\"International Journal of Computational Geometry and Applications\",\"volume\":\"1631 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-09-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"38\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Computational Geometry and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1142/S0218195900000358\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computational Geometry and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/S0218195900000358","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Drawing Directed Acyclic Graphs: An Experimental Study
In this paper we consider the class of directed acyclic graphs (DAGs), and present the results of an experimental study on four drawing algorithms specifically developed for DAGs. Our study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and aspect ratio. The algorithms exhibit various trade-offs with respect to the quality measures, and none of them clearly outperforms the others.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
