{"title":"To draw a tree","authors":"P. Hanrahan","doi":"10.1109/INFVIS.2001.963272","DOIUrl":null,"url":null,"abstract":"The quintessential goal of information visualization is depicting abstractions and relations for non-spatial data. A hierarchy is a particularly expressive abstraction that can be applied to a broad range of domains: the genealogical lineages of human descent, the functional decomposition of complex mechanical objects, the classification of knowledge, the evolutionary relationships between species. All of these hierarchical relationships are representable through the abstraction of a recursively defined tree. For this reason, trees occupy a place along with arrays, lists and graphs as one of the most important data structures in computer science. Considering the simple problem of how to effectively draw a tree uncovers many issues fundamental to information visualization. Different drawing styles emphasize different properties of trees, often in subtle ways. I will discuss how people think about trees, and thus what kinds of relationships a tree drawing can usefully convey. My discussion will include a review of many methods for drawing trees, including both historical examples from the sciences and techniques recently developed by researchers in information visualization.","PeriodicalId":131263,"journal":{"name":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Symposium on Information Visualization, 2001. INFOVIS 2001.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFVIS.2001.963272","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

The quintessential goal of information visualization is depicting abstractions and relations for non-spatial data. A hierarchy is a particularly expressive abstraction that can be applied to a broad range of domains: the genealogical lineages of human descent, the functional decomposition of complex mechanical objects, the classification of knowledge, the evolutionary relationships between species. All of these hierarchical relationships are representable through the abstraction of a recursively defined tree. For this reason, trees occupy a place along with arrays, lists and graphs as one of the most important data structures in computer science. Considering the simple problem of how to effectively draw a tree uncovers many issues fundamental to information visualization. Different drawing styles emphasize different properties of trees, often in subtle ways. I will discuss how people think about trees, and thus what kinds of relationships a tree drawing can usefully convey. My discussion will include a review of many methods for drawing trees, including both historical examples from the sciences and techniques recently developed by researchers in information visualization.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
画一棵树
信息可视化的基本目标是描述非空间数据的抽象和关系。层次结构是一种特别具有表现力的抽象概念,可以应用于广泛的领域:人类血统的谱系,复杂机械物体的功能分解,知识的分类,物种之间的进化关系。所有这些层次关系都可以通过递归定义的树的抽象来表示。因此,树与数组、列表和图一样,都是计算机科学中最重要的数据结构之一。考虑如何有效地绘制树的简单问题揭示了信息可视化的许多基本问题。不同的绘画风格强调树的不同属性,通常以微妙的方式。我将讨论人们是如何看待树的,以及一幅树图可以有效地传达什么样的关系。我的讨论将包括对绘制树的许多方法的回顾,包括科学中的历史例子和信息可视化研究人员最近开发的技术。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
To draw a tree 2D vs 3D, implications on spatial memory Ordered treemap layouts Visualizing time-series on spirals Change blindness in information visualization: a case study
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1