Tadaaki Kirishima, Tomoo Sumida, Yasunori Shiono, T. Goto, T. Yaku, T. Nishino, K. Tsuchida
{"title":"树形图绘制问题的O(n)和O(n2)时间算法","authors":"Tadaaki Kirishima, Tomoo Sumida, Yasunori Shiono, T. Goto, T. Yaku, T. Nishino, K. Tsuchida","doi":"10.1109/SNPD.2012.109","DOIUrl":null,"url":null,"abstract":"We investigate sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we present efficient algorithms that provide narrower placement satisfying given amorphous conditions. In intractable conditions, we propose a constraint-based algorithm for drawing tree-structured diagrams with a minimum-width by limiting the number of cells. Our results provide a criterion for deciding under given conditions, whether to use procedural or constraint-based algorithms to draw a tree-structured diagram.","PeriodicalId":387936,"journal":{"name":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2012-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams\",\"authors\":\"Tadaaki Kirishima, Tomoo Sumida, Yasunori Shiono, T. Goto, T. Yaku, T. Nishino, K. Tsuchida\",\"doi\":\"10.1109/SNPD.2012.109\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we present efficient algorithms that provide narrower placement satisfying given amorphous conditions. In intractable conditions, we propose a constraint-based algorithm for drawing tree-structured diagrams with a minimum-width by limiting the number of cells. Our results provide a criterion for deciding under given conditions, whether to use procedural or constraint-based algorithms to draw a tree-structured diagram.\",\"PeriodicalId\":387936,\"journal\":{\"name\":\"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-08-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SNPD.2012.109\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 13th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SNPD.2012.109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
O(n) and O(n2) Time Algorithms for Drawing Problems of Tree-Structured Diagrams
We investigate sets of conditions with respect to narrower drawing of tree-structured diagrams on an integral lattice. We found that under certain sets of conditions there are practical procedural algorithms for narrower drawing of tree-structured diagrams, while under other sets of conditions there are none. Based on our findings, we present efficient algorithms that provide narrower placement satisfying given amorphous conditions. In intractable conditions, we propose a constraint-based algorithm for drawing tree-structured diagrams with a minimum-width by limiting the number of cells. Our results provide a criterion for deciding under given conditions, whether to use procedural or constraint-based algorithms to draw a tree-structured diagram.