{"title":"在图中可视化加权边","authors":"P. Rodgers, P. Mutton","doi":"10.1109/IV.2003.1217988","DOIUrl":null,"url":null,"abstract":"We introduce a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing Web page similarity data.","PeriodicalId":259374,"journal":{"name":"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.","volume":"323 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Visualizing weighted edges in graphs\",\"authors\":\"P. Rodgers, P. Mutton\",\"doi\":\"10.1109/IV.2003.1217988\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We introduce a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing Web page similarity data.\",\"PeriodicalId\":259374,\"journal\":{\"name\":\"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.\",\"volume\":\"323 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings on Seventh International Conference on Information Visualization, 2003. IV 2003.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IV.2003.1217988\",\"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 on Seventh International Conference on Information Visualization, 2003. IV 2003.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IV.2003.1217988","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We introduce a new edge length heuristic that finds a graph layout where the edge lengths are proportional to the weights on the graph edges. The heuristic can be used in combination with the spring embedder to produce a compromise between a drawing with an accurate presentation of edge length and a drawing with good general comprehensibility. We describe our preliminary investigations in combining the two methods so that a user can tune their preference and demonstrate the effectiveness of the system on both randomly generated graphs and graphs representing Web page similarity data.