{"title":"A heuristics approach to automatic data flow diagram layout","authors":"K. P. Tan, G. H. Ong, P. Wong","doi":"10.1109/CASE.1993.634835","DOIUrl":null,"url":null,"abstract":"A heuristics method for the automatic placement of data flow diagrams (DFDs) is presented. It fulfills the whole set of aesthetics requirements for a nice DFD layout within an acceptable time bound. The system allocates the process with most data flows at the center of a 2-D grid space and effectively handles the positional preference for entities, processes, and data stores. The test cut function detects any crisscrossing of data flows and any cutting of DFD objects. The pop function pops up to those objects of high intersection weight to the upper layer under aesthetics optimization. This 3-D DFD contains only linear data flows with all crisscrossings eliminated. A noncutting connection between two objects can be seen clearly by rotating the 3-D DFD at every 90/spl deg/ step. Thus, the heuristics method realizes the abstraction of automatic diagram creation.","PeriodicalId":442754,"journal":{"name":"Proceedings of 6th International Workshop on Computer-Aided Software Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1993-07-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 6th International Workshop on Computer-Aided Software Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CASE.1993.634835","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
A heuristics method for the automatic placement of data flow diagrams (DFDs) is presented. It fulfills the whole set of aesthetics requirements for a nice DFD layout within an acceptable time bound. The system allocates the process with most data flows at the center of a 2-D grid space and effectively handles the positional preference for entities, processes, and data stores. The test cut function detects any crisscrossing of data flows and any cutting of DFD objects. The pop function pops up to those objects of high intersection weight to the upper layer under aesthetics optimization. This 3-D DFD contains only linear data flows with all crisscrossings eliminated. A noncutting connection between two objects can be seen clearly by rotating the 3-D DFD at every 90/spl deg/ step. Thus, the heuristics method realizes the abstraction of automatic diagram creation.