{"title":"2.5D图形布局的导航技术","authors":"A. Ahmed, Seok-Hee Hong","doi":"10.1109/APVIS.2007.329279","DOIUrl":null,"url":null,"abstract":"In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy some of the criteria. In particular, we design and implement methods for trees, clustered graphs and hierarchical graphs drawn in 2.5 dimensions.","PeriodicalId":136557,"journal":{"name":"2007 6th International Asia-Pacific Symposium on Visualization","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-10-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Navigation techniques for 2.5D graph layout\",\"authors\":\"A. Ahmed, Seok-Hee Hong\",\"doi\":\"10.1109/APVIS.2007.329279\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy some of the criteria. In particular, we design and implement methods for trees, clustered graphs and hierarchical graphs drawn in 2.5 dimensions.\",\"PeriodicalId\":136557,\"journal\":{\"name\":\"2007 6th International Asia-Pacific Symposium on Visualization\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 6th International Asia-Pacific Symposium on Visualization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APVIS.2007.329279\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 6th International Asia-Pacific Symposium on Visualization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APVIS.2007.329279","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
In this paper, we consider the problem of navigating graphs drawn in 2.5 dimensions. First, we define criteria for good navigation and then present various methods to satisfy some of the criteria. In particular, we design and implement methods for trees, clustered graphs and hierarchical graphs drawn in 2.5 dimensions.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
