{"title":"使用魔法镜头和过滤对图形内容进行可视化访问","authors":"Jakub Ukrop, Zuzana Cíková, Peter Kapec","doi":"10.1145/2448531.2448534","DOIUrl":null,"url":null,"abstract":"Graph visualization is a large and still evolving problem area in which new approaches appear. Graphs are often used to represent information that contains relations among data. Visual presentation of graphs aims at better graphs comprehension, however one problem in graph visualization is still present: how to effectively access the information stored in nodes and/or edges of graph. In this paper, we present our approach for visual accessing of graph content by using visual nodes. We also present how a hyper-graph based query language can be used in conjunction with magic lenses to lower visual clutter.","PeriodicalId":235681,"journal":{"name":"Spring conference on Computer graphics","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-03-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Visual access to graph content using magic lenses and filtering\",\"authors\":\"Jakub Ukrop, Zuzana Cíková, Peter Kapec\",\"doi\":\"10.1145/2448531.2448534\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Graph visualization is a large and still evolving problem area in which new approaches appear. Graphs are often used to represent information that contains relations among data. Visual presentation of graphs aims at better graphs comprehension, however one problem in graph visualization is still present: how to effectively access the information stored in nodes and/or edges of graph. In this paper, we present our approach for visual accessing of graph content by using visual nodes. We also present how a hyper-graph based query language can be used in conjunction with magic lenses to lower visual clutter.\",\"PeriodicalId\":235681,\"journal\":{\"name\":\"Spring conference on Computer graphics\",\"volume\":\"18 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-03-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Spring conference on Computer graphics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2448531.2448534\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Spring conference on Computer graphics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2448531.2448534","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Visual access to graph content using magic lenses and filtering
Graph visualization is a large and still evolving problem area in which new approaches appear. Graphs are often used to represent information that contains relations among data. Visual presentation of graphs aims at better graphs comprehension, however one problem in graph visualization is still present: how to effectively access the information stored in nodes and/or edges of graph. In this paper, we present our approach for visual accessing of graph content by using visual nodes. We also present how a hyper-graph based query language can be used in conjunction with magic lenses to lower visual clutter.