{"title":"如何画有向图","authors":"P. Eades, Xuemin Lin","doi":"10.1109/WVL.1989.77035","DOIUrl":null,"url":null,"abstract":"Several recent tools for visualizing software and information engineering problems have used directed graphs as a basic model. Thus considerable interest has arisen in algorithms for drawing directed graphs so that they are easy to understand and remember. The paper defines three aesthetic criteria for drawings of directed graphs, and discusses a general method for obtaining drawings according to these criteria. Several recent algorithms to draw directed graphs are instances of this general method. The aesthetic criteria can be viewed as goals of optimization problems. Each step of the general method aims to achieve one of the criteria by solving these optimization problems. The authors discuss the current state of knowledge of each of these problems.<<ETX>>","PeriodicalId":326582,"journal":{"name":"[Proceedings] 1989 IEEE Workshop on Visual Languages","volume":"105 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1989-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"215","resultStr":"{\"title\":\"How to draw a directed graph\",\"authors\":\"P. Eades, Xuemin Lin\",\"doi\":\"10.1109/WVL.1989.77035\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Several recent tools for visualizing software and information engineering problems have used directed graphs as a basic model. Thus considerable interest has arisen in algorithms for drawing directed graphs so that they are easy to understand and remember. The paper defines three aesthetic criteria for drawings of directed graphs, and discusses a general method for obtaining drawings according to these criteria. Several recent algorithms to draw directed graphs are instances of this general method. The aesthetic criteria can be viewed as goals of optimization problems. Each step of the general method aims to achieve one of the criteria by solving these optimization problems. The authors discuss the current state of knowledge of each of these problems.<<ETX>>\",\"PeriodicalId\":326582,\"journal\":{\"name\":\"[Proceedings] 1989 IEEE Workshop on Visual Languages\",\"volume\":\"105 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1989-10-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"215\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings] 1989 IEEE Workshop on Visual Languages\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WVL.1989.77035\",\"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] 1989 IEEE Workshop on Visual Languages","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WVL.1989.77035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Several recent tools for visualizing software and information engineering problems have used directed graphs as a basic model. Thus considerable interest has arisen in algorithms for drawing directed graphs so that they are easy to understand and remember. The paper defines three aesthetic criteria for drawings of directed graphs, and discusses a general method for obtaining drawings according to these criteria. Several recent algorithms to draw directed graphs are instances of this general method. The aesthetic criteria can be viewed as goals of optimization problems. Each step of the general method aims to achieve one of the criteria by solving these optimization problems. The authors discuss the current state of knowledge of each of these problems.<>
![[Proceedings] 1989 IEEE Workshop on Visual Languages](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
