Fractal Approaches for Visualizing Huge Hierarchies. Hideki Koike Hirotaka Yoshihara 3. Department of Communications and Systems
|
|
- Elaine Underwood
- 6 years ago
- Views:
Transcription
1 Fractal Approaches for Visualizing Huge Hierarchies Hideki Koike Hirotaka Yoshihara 3 Department of Communications and Systems University of Electro-Communications Chofu, Tokyo 182, Japan Abstract This paper describes fractal approaches to the problems which associate with visualizing huge hierarchies. The geometrical characteristic of a fractal, selfsimilarity, allows users to visually interact with a huge tree in the same manner at every level of the tree. The fractal dimension, a measure of complexity, makes it possible to control the total amount of displayed nodes. A prototype visualization system for UNIX directories is also shown. 1 Introduction Visualization systems for hierarchical structures, especially for huge 1 data structures, have a potential usefulness. For example, the visualization of whole UNIX directories might help system administrators to maintain the le systems. Since administrators could recognize, through the visualization, local le systems of each computer and remote le systems mounted by using NFS (Network File System), they might avoid mistakes, such as deleting or moving les which are being referenced by other computers. It is, however, meaningless to visualize such huge data with a current tree visualization framework. With an exponential explosion in size of a tree, when users focus on a node, they cannot see the minimum information, such as its parent, children, or siblings, in a scrollable window. Also, an increase of visual elements is detrimental to human's cognitive load as well as to the system's response time. On the other hand, we had proposed a fractalbased method for information display control, fractal views[10]. As is described later, this method can be applied to tree structures, and can control the number of displayed nodes without relation to the shape of trees. In [10], we applied our method to program display, and showed its ability with comparison to generalized sheye views[6]. This paper, by focusing on the visualization of huge hierarchical structures, describes how our fractal approaches reduce these problems. The next section describes previous work for visualizing hierarchies and their problems. Section 3 describes our fractal approaches. Section 4 shows a prototype system we have 3 Current address: Pioneer Corporation, 4{15{5, Omorinishi, Ota-ku, Tokyo 143, Japan 1 The term huge is used as hundreds/thousands of data. developed. Section 5 discusses the limitations of our framework and some hints on how to solve them. Section 6 is a conclusion. 2 Visualizing Huge Hierarchies 2.1 Exponential Explosion in Size There exist many interactive visual systems which display hierarchical structures as trees on video displays[22, 20]. In general, such systems use conventional tree layout algorithms[24, 15, 3], which lay out nodes as economically and attractively as possible based on the size of node and the oset between nodes. The width of the tree, however, increases exponentially corresponding to the depth of the tree. Consider, for example, an N branch tree in 2D (Figure 1). d n-1 d n Figure 1: Two-dimensional tree layout. dn is the width which is necessary to draw all subtrees under the tree at depth n. To simplify the problem, the oset is set to 0. Then, the width d n in depth n is represented as: To generalize: d n = Nd n01 (1) d n = d 1 N n01 (2) It is clear that the width increases exponentially. The ConeTree[16] developed at Xerox PARC demonstrated a 3D tree visualization framework. The ConeTree made it possible to display larger number of nodes by using 3D space. The exponential explosion in size, however, remains the same. Figure 2 represents the top view of a cone tree for an N branch tree. In this gure, r n is a radius which is necessary to draw
2 rn-1 rn-rn-1 2 rn Figure 2: The top view of a cone tree for an N branch tree. rn is the radius which is necessary to draw all cones under the cone at depth n. all cones under the cone at depth n. It means that the radius of the cone at depth n is r n 0 r n01. It is easy to note the following relation. r n01 r n 0 r n01 = sin 2 (3) Since has a relation, = 2=N, if we eliminate from equation (3), we obtain: To generalize: r n = (1 + 1 sin )r n01 (4) N r n = r 1 (1 + 1 ) n01 (5) sin N The tree size also increases exponentially. 2.2 Scrolling is Useless The exponential explosion in size causes overow o the screen. The general solution of this problem is scrolling. Scrolling is a technique to see, through a window which is physically limited in size, a object which is larger than the window size, by moving it horizontally or vertically. With scrolling, users can see the local details of every part of the tree. In case of huge trees, however, the scrolling is no practical use. As the tree size increases exponentially, the distance between nodes also increases, especially at upper level of the tree. As a result, when the users focus on a node, they cannot see the minimum information such as its parent, children, or siblings in a scrollable window. Also, it is hard to trace links with scrolling to see its neighbors. When users reach another node, they cannot see the original node any more. Thus, the combination of the conventional tree layout and the scrolling is not appropriate to the visualization framework for huge hierarchies. 2.3 Increase of Visual Elements It should be also considered how the increase of visual elements aects users' cognitive load as well as the system's response time. It is often said that the human understands information faster and more clearly in visual representations than in text. Using Figure 3: A fractal tree. the parallelism capability of human's visual and cognitive system, we are able to rapidly process many pieces of information at one time. The increase of visual elements, however, makes the diagram complex, and as a result it adversely aects our cognition. Also, the increase of visual elements reduces the system's response time. In visual systems, the refresh rate of the graphics deteriorates with an increasing number of displayed objects. Visualization systems for huge data, therefore, should have the ability to reduce visual elements. 3 Fractal Approach In the previous section, two problems are addressed for the visualization of huge hierarchies. In this section, we will describe our fractal approaches to these problems. Although the two approaches are based on a concept of a fractal, it is important to notice that each approach uses a dierent characteristic of a fractal. 3.1 Fractal Views As is well known, a word fractal was proposed by B. Mandelbrot[12] and it represents a wide variety of self-similar objects. For example, a binary tree in Figure 3 is a fractal. Each edge length is r times larger than its previous one. There exists a relation: D = 0 log r N (6) between the branching factor, N, and the scale factor, r. This constant D is called a fractal dimension. Although general trees are not self-similar, if the relation: D = 0 log rx N x (7) exists between the branching factor N x at node x and the scale factor r x, this tree is also said to be a fractal 2. In [10], we had proposed a fractal-based method for information display control, fractal views, which is an extension of a fractal concept to logical trees. Fractal views calculate the degree of importance, which is called fractal value for convenience, of each node, and decide which nodes should be displayed or erased 2 The detailed discussion is held in [10]
3 based on these fractal values. The fractal value F v x of node x is calculated with the following equation. F vfocus = 1 F v child of x = r x 2 Fv x (8) r x = CN 0 1 D x where N x is a branching factor at node x, D is a fractal dimension, and C is a constant value which satises 0 < C 1. For simplify the calculation, C is set to 1 in our system. The most important property of fractal views is the ability to control the amount of data displayed. In an N branch tree, the total number of nodes, M, whose depth is smaller than or equal to n, is represented as: M = N n N 0 1 (9) On the other hand, the propagated value, F v, of node at depth n is F v = r n = N 0n=D (10) Thus, M is represented without n as: M = F 0D v 0 1=N 1 0 1=N (11) As N becomes large, M moves asymptotically towards Fv 0D. It should be noticed that M begins to approach Fv 0D at relatively small branching factor, N, of 3 or 4. That is, the number of nodes which have a value greater than or equal to the threshold is nearly constant without a relation to the branching factor. There is a similar method called generalized sheye views by Furnas[6]. In sheye views, the degree of importance (DOI) of each node is calculated, with a distance from the root (0AP I) and a distance from the focus (D), as: DOI = AP I 0 D (12) Since the number of nodes which have the same DOI value increases corresponding to the branching factor, it is hard to control the number of displayed nodes. Section 4.3 describes the comparative experiments with sheye views and fractal views. 3.2 Fractal Tree Layout Using the self-similarity characteristic of a fractal, it is possible to standardize the view at every level of the tree. In a fractal tree, a similar view is obtained when a subtree is magnied. When a part of the subtree is magnied, a similar view appears as well. Figure 4 represents this concept. However huge the displayed tree is, the view obtained by focusing on a part of the tree is almost the same. In a visualization system for hierarchical structures, nodes have more important roles than edges. Thus, each node size should be reduced with the edge length using the same scale factors. Figure 4: The concept of fractal layout. If we use this framework, we cannot recognize nodes whose sizes are smaller than a threshold. This is not shortcoming of our framework. On the contrary, users can concentrate their attention on the focus and its neighbors since they may not see the nodes far from the focus. Moreover, as is clear from the previous discussion, the number of nodes whose fractal values are greater than a threshold is nearly constant. In the fractal tree layout, each node size is proportional to its fractal value. Thus, the number of recognizable nodes is almost constant. 3.3 Fractal Pruning Although the fractal layout makes it possible to keep the total amount of recognizable nodes to be nearly constant, it is not enough for a practical visualization system. Since all the displayed nodes, whether they are recognizable or not, reduce the system's response time, these unrecognizable nodes as well as the nodes outside the viewing area should be erased. Fractal views can be used for this purpose. Following equation (8), the fractal value of each node is calculated. If we erase the nodes which have smaller values than a threshold, we can display the nodes near the focus. It is important that, once the threshold is set, the number of displayed nodes is constant when users change their focus of attention. It makes it possible to keep the system's response time to be constant, and it may also keep human's cognitive load to be constant. 4 Prototype System 4.1 Overview A visualization system 3 for UNIX directories is implemented. Figure 5 is a snapshot of the screen. When the system is executed with a directory name, after the directory information is obtained by using UNIX system calls, a 3D tree whose root node represents the directory appears on the screen. The reason we adopted the 3D framework is to make eective use of the screen. Each node corresponds to the UNIX le, 3 This system was implemented in our software visualization system VOGUE[8, 9].
4 Figure 5: Snapshot of the screen. and its label represents its pathname. The color assigned to nodes represents le's type such as ASCII le, binary le, or directory. The relation between a parent directory and its subdirectory is represented as a link. Symbolic links in UNIX are represented as additional links with dierent color. The system supplies several interaction capabilities. Four vertical sliders are used to change users' viewpoints with animation. Although how to change viewpoints in 3D is an important problem to be solved, it is beyond of our research. Thus, some ways to move in 3D space were prepared. There are also several buttons on the control panel. For demonstrational purpose, users can choose the tree layout from 2D, ConeTree, and Fractal Tree, by pushing the button on the panel. When users select a node corresponding to a text le by mouse and pushes the \Edit" button, an editor window will open. The \Find" button is used to nd a specic le. Since there are huge numbers of nodes, it is sometimes hard to nd visually the specic node. When users type a le name that they want to see, and push the button, a node with the name highlights. Also, there are the \Fisheye" button and the \Fractal" button. The details of these buttons are described later. 4.2 Self-similar Views Figure 5 and Figure 6 show how a user moves his/her focus of attention. First, the user's focus is on the root node in Figure 5, and he/she can identify its children. When he/she selects one of the children and zooms in with a slider, the cone with the child and grandchildren, which is very similar to the cone with the root and its children, appears (see the upper gure in Figure 6). Also, when he/she selects one of the grandchildren and zooms in, another cone which is also similar to other cones, appears (see the lower gure in Figure 6). Throughout the whole tree, the user can see the local relation and can manipulate nodes in the same manner. Through the experimental use of our system, we found that users need a smaller number of mouse actions in the fractal style than in the normal cone style. This is because the users can move their focus to a subdirectory in only one action with fractal style. On Figure 6: Examples of self-similar views. the other hand, with normal cone style, they have to use sliders to nd children, especially at upper levels of the tree. 4.3 Pruning The system also has the capability to reduce visual elements with sheye views or fractal views. If the user selects a node and pushes the \Fisheye" button on the control panel, the whole path from the selected node to the root node is displayed. If he/she increments the threshold by pushing on the button on the panel, the number of displayed nodes increases. The number of displayed nodes, however, changes considerably when the user increments (or decrements) the threshold, such as in Figure 7. It was also found that the number of displayed nodes changes considerably when the user changes his/her focus even if he/she set the same threshold. In our experiments, sheye views were not eective to control the number of nodes, especially in a huge tree. Alternatively, when the user selects the \Fractal" button, he/she can obtain fractal views from the focus. Initially, fractal views do not display the whole path to the root. By changing a threshold with a slider, it is possible to increase the number of displayed nodes almost continuously, such as in Figure 8. When the user selects another node, the fractal view from the
5 Figure 7: An example of sheye views. Figure 8: An example of fractal views. new focus is obtained interactively. Then, the number of displayed nodes is kept to be nearly constant even if the user focuses on any nodes. The combination of the fractal layout and the fractal pruning made it easier to browse huge trees such as UNIX directories. 5 Discussion Our simple idea to apply a fractal to the tree layout made it possible to visually interact with a huge tree in the same manner at every level of the tree. This is due to the fractal's geometrical characteristic, self-similarity. It is important that the number of recognizable nodes is almost constant in this framework. Users can see almost the same number of nodes. It should be noticed that the information display control we presented here is not based on this selfsimilarity. It uses the fractal dimension which is a measure of complexity. It is assured that fractal objects created by the same dimension have the same complexity even if they have dierent shapes. Roughly speaking, fractal views replace the same complexity in physical objects with the same amount in logical trees. Since the displayed nodes are kept to be nearly constant in fractal views, both users' cognitive load and system's response time are kept to be nearly constant. On the other hand, many problems remain unsolved. First, strictly speaking, our framework is not a 3D layout algorithm, because currently our algorithm does not check the overlap of cones. In our framework, each edge length is decided in a topdown manner. Therefore, it is not possible to change the edge length for preventing overlapping. This problem is partially solved by changing a fractal dimension, D. In case of a 2D fractal tree, the fractal dimension represents the dimension of a set of branch tips. If the fractal dimension becomes smaller, the space between tips becomes larger. Thus, if we use a smaller dimension, the overlap of cones could be minimized. Another factor to prevent overlapping is the concept of self-avoidance[12, page 152]. It is important to notice that, in fractal trees, self-similarity is dierent from self-avoidance. The angle of each branch has no relation to the fractal dimension D and the scale factor r. The angle is decided independently. Figure 9 is a fractal binary tree with the same fractal dimension of the tree in Figure 3, but it is prevented from overlapping of edges. There are many capabilities to be embedded in our system. For example, automatic rotation of cones, which was demonstrated in the ConeTrees, is useful. Shadows[16, 7] of 3D objects may help users' cognition. Also, formal user studies have to be done. 6 Conclusion In this paper, we proposed fractal approaches for visualization of huge hierarchies. The geometrical characteristic of a fractal, self-similarity, made it possible to visually interact with a huge tree in the same manner at every level of the tree. The fractal dimension,
6 [8] H. Koike. An application of three-dimensional visualization to object-oriented programming. In T. Catarci, M. F. Costabile, and S. Levialdi, editors, Advanced Visual Interfaces (Proceedings of the International Workshop AVI'92), pp. 180{192. World Scientic, [9] H. Koike. The Role of Another Spatial Dimension in Software Visualization. ACM Transaction on Information Systems, Vol. 11, No. 3,, July [10] H. Koike and T. Ishii. A fractal-based method for information display control. Trans. of Information Processing Society of Japan, Vol. 33, No. 2, pp. 101{109, Figure 9: A fractal tree. Although its fractal dimension is the same as that of Figure 3, its edges do not overlap each other. a measure of complexity, made it possible to keep the number of displayed nodes nearly constant. Although a tree visualization might seem to be an old-fashioned theme to research, many problems, however, remain unsolved. Visual systems, such as visual programming systems[18], algorithm animation systems[1, 21, 2], and so on, have been found a great success in the last decade. They, however, have manipulated rather small amounts of data. We believe visual representations will play more crucial roles in visualizing huge data, due to their ability to abstract information. Thus, for further success of visual systems, it is important to identify the problems that happen in applying current visualization framework to huge data structures. References [1] M. H. Brown. Algorithm Animation. MIT Press, Cambridge, MA, [2] M. H. Brown. Zeus: A system for algorithm animation and multi-view editing. In 1991 IEEE Workshop on Visual Languages, pp. 4{9, October [3] P. Eades and R. Tamassia. Algorithms for automatic graph drawing: An annotated bibliography. Technical Report 82, Dept. of Computer Science, Univ. of Queensland, [4] K. M. Fairchild, S. E. Poltrock, and G. W. Furnas. Sem- Net: Three-Dimensional Graphic Representation of Large Knowledge Bases. In R. Guindon, editor, Cognitive Science And Its Applications For Human-Computer Interaction, pp. 201{233. Lawrence Erlbaum Associates, [5] J. Feder. FRACTALS. Plenum, New York, [6] G. W. Furnas. Generalized sheye views. In Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI'86), pp. 16{23. ACM Press, [7] K. P. Herndon, R. C. Zeleznik, D. C. Robbins, D. B. Conner, S. S. Snibbe, and A. van Dam. Interactive Shadows. In Proceedings of the ACM Symposium on User Interface Software and Technology (UIST'92), pp. 1{6, [11] H. Lieberman. A Three-Dimensional Representation for Program Execution. In Proceedings of 1989 IEEE Workshop on Visual Languages. IEEE CS Press, [12] B. B. Mandelbrot. The Fractal Geometry of Nature. W.H.Freeman and Company, New York, [13] H.-O. Peitgen, H. Jurgens, and D. Saupe, editors. Fractals for the Classroom: Part One Introduction to Fractals and Chaos. Springer-Verlag, New York, [14] H.-O. Peitgen and D. Saupe, editors. The Science of Fractal Images. Springer-Verlag, [15] E. M. Reingold and J. S. Tilford. Tidier drawings of trees. IEEE Trans. on Software Engineering, Vol. 7, No. 2, pp. 223{228, [16] G. G. Robertson, J. D. Mackinlay, and S. K. Card. Cone Trees: Animated 3D Visualizations of Hierarchical Information. In Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI'91), pp. 189{194. ACM Press, [17] M. Sarkar and M. H. Brown. Graphical sheye views of graphs. In Proceedings of the ACM Conference on Human Factors in Computing Systems (CHI'92), pp. 83{91. ACM Press, [18] N. C. Shu. Visual Programming. Van Nostrand Reinhold, New York, [19] Silicon Graphics, Inc. FSN: File System Navigator, online manual. [20] Silicon Graphics, Inc. IRIS WorkSpace User's Guide, [21] J. T. Stasko. TANGO: A Framework and System for Algorithm Animation. Computer, Vol. 23, No. 9, pp. 27{39, September [22] W. Teitelman and L. Masinter. The Interlisp programming environment. In D. R. Barstow, H. E. Shrobe, and E. Sandewall, editors, Interactive Programming Environments. McGraw-Hill, [23] T. Vicsek. Fractal Growth Phenomena. World Scientic, London, [24] C. Wetherell and A. Shannon. Tidy drawings of trees. IEEE Trans. on Software Engineering, Vol. 5, No. 5, pp. 514{520, 1979.
Client 1. Client 2. out. Tuple Space (CB400, $5400) (Z400, $4800) removed from tuple space (Z400, $4800) remains in tuple space (CB400, $5400)
VisuaLinda: A Framework and a System for Visualizing Parallel Linda Programs Hideki Koike 3 Graduate School of Information Systems University of Electro-Communications 1{5{1, Chofugaoka, Chofu, Tokyo 182,
More informationProviding Interactive Site Ma ps for Web Navigation
Providing Interactive Site Ma ps for Web Navigation Wei Lai Department of Mathematics and Computing University of Southern Queensland Toowoomba, QLD 4350, Australia Jiro Tanaka Institute of Information
More informationRINGS : A Technique for Visualizing Large Hierarchies
RINGS : A Technique for Visualizing Large Hierarchies Soon Tee Teoh and Kwan-Liu Ma Computer Science Department, University of California, Davis {teoh, ma}@cs.ucdavis.edu Abstract. We present RINGS, a
More informationHierarchies and Trees 1 (Node-link) CS Information Visualization November 12, 2012 John Stasko
Topic Notes Hierarchies and Trees 1 (Node-link) CS 7450 - Information Visualization November 12, 2012 John Stasko Hierarchies Definition Data repository in which cases are related to subcases Can be thought
More informationHierarchies and Trees 1 (Node-link) CS 4460/ Information Visualization March 10, 2009 John Stasko
Hierarchies and Trees 1 (Node-link) CS 4460/7450 - Information Visualization March 10, 2009 John Stasko Hierarchies Definition Data repository in which cases are related to subcases Can be thought of as
More informationHousing Layout Design using Fractals:
Housing Layout Design using Fractals: Computer Tool and its Practical Use Yoshihiro Kobayashi, Ph.D. (ykobaya@asu.edu) Subhadha Battina (sbattina@asu.edu) Arizona State University School of Architecture
More informationInformation Visualization. Jing Yang Spring Hierarchy and Tree Visualization
Information Visualization Jing Yang Spring 2008 1 Hierarchy and Tree Visualization 2 1 Hierarchies Definition An ordering of groups in which larger groups encompass sets of smaller groups. Data repository
More informationCourtesy of Prof. Shixia University
Courtesy of Prof. Shixia Liu @Tsinghua University Introduction Node-Link diagrams Space-Filling representation Hybrid methods Hierarchies often represented as trees Directed, acyclic graph Two main representation
More informationVisualising File-Systems Using ENCCON Model
Visualising File-Systems Using ENCCON Model Quang V. Nguyen and Mao L. Huang Faculty of Information Technology University of Technology, Sydney, Australia quvnguye@it.uts.edu.au, maolin@it.uts.edu.au Abstract
More informationCSE 214 Computer Science II Introduction to Tree
CSE 214 Computer Science II Introduction to Tree Fall 2017 Stony Brook University Instructor: Shebuti Rayana shebuti.rayana@stonybrook.edu http://www3.cs.stonybrook.edu/~cse214/sec02/ Tree Tree is a non-linear
More information1 Introduction Normal text viewers (whether paging or scrolling) present text to the user screen by screen, with the result that contextual cues for l
Viewing Text With Non-Linear Magnication: An Experimental Study T. Alan Keahey tkeahey@cs.indiana.edu Julianne Marley jmarley@cs.indiana.edu Department of Computer Science 215 Lindley Hall Indiana University
More informationDOITrees Revisited: Scalable, Space-Constrained Visualization of Hierarchical Data
DOITrees Revisited: Scalable, Space-Constrained Visualization of Hierarchical Data Jeffrey Heer 1,2 1 Group for User Interface Research University of California, Berkeley Berkeley, CA 9472-1776 USA jheer@cs.berkeley.edu
More informationCPSC 583 Presentation Space: part I. Sheelagh Carpendale
CPSC 583 Presentation Space: part I Sheelagh Carpendale Context Basic ideas Partition Compression Filtering Non-linear magnification Zooming Partition: Windowing Xerox Star The main presentation ideas
More informationVisualizing Complex Hypermedia Networks through Multiple Hierarchical Views
Visualizing Complex Hypermedia Networks through Multiple Hierarchical Views Sougata Mukherjea, James D. Foley, Scott Hudson Graphics, Visualization & Usability Center College of Computing Georgia Institute
More informationVisualizing and Animating Search Operations on Quadtrees on the Worldwide Web
Visualizing and Animating Search Operations on Quadtrees on the Worldwide Web František Brabec Computer Science Department University of Maryland College Park, Maryland 20742 brabec@umiacs.umd.edu Hanan
More informationAn Occlusion-Reduced 3D Hierarchical Data Visualization Technique
An Occlusion-Reduced 3D Hierarchical Data Visualization Technique Reiko Miyazaki, Takayuki Itoh Ochanomizu University {reiko, itot}@itolab.is.ocha.ac.jp Abstract Occlusion is an important problem to be
More informationAn Improved Fisheye Zoom Algorithm for Visualizing and Editing Hierarchical Models
An Improved Fisheye Zoom Algorithm for Visualizing and Editing Hierarchical Models Tobias Reinhard, Silvio Meier, Martin Glinz Department of Informatics, University of Zurich, Switzerland reinhard, smeier,
More informationEdge Equalized Treemaps
Edge Equalized Treemaps Aimi Kobayashi Department of Computer Science University of Tsukuba Ibaraki, Japan kobayashi@iplab.cs.tsukuba.ac.jp Kazuo Misue Faculty of Engineering, Information and Systems University
More informationStatic Visualization of Dynamic Data Flow Visual Program Execution
Static Visualization of Dynamic Data Flow Visual Program Execution Buntarou Shizuki Institute of Information Sciences and Electronics University of Tsukuba shizuki@is.tsukuba.ac.jp Etsuya Shibayama Graduate
More informationHousing Layout Design Using Fractals A Computer Tool and its Practical Use
Housing Layout Design Using Fractals A Computer Tool and its Practical Use KOBAYASHI Yoshihiro and BATTINA Subhadha College of Architecture and Environmental Design, Arizona State University, USA Keywords:
More informationConstrained Clustering with Interactive Similarity Learning
SCIS & ISIS 2010, Dec. 8-12, 2010, Okayama Convention Center, Okayama, Japan Constrained Clustering with Interactive Similarity Learning Masayuki Okabe Toyohashi University of Technology Tenpaku 1-1, Toyohashi,
More informationUsing the Holey Brick Tree for Spatial Data. in General Purpose DBMSs. Northeastern University
Using the Holey Brick Tree for Spatial Data in General Purpose DBMSs Georgios Evangelidis Betty Salzberg College of Computer Science Northeastern University Boston, MA 02115-5096 1 Introduction There is
More informationSILVACO. An Intuitive Front-End to Effective and Efficient Schematic Capture Design INSIDE. Introduction. Concepts of Scholar Schematic Capture
TCAD Driven CAD A Journal for CAD/CAE Engineers Introduction In our previous publication ("Scholar: An Enhanced Multi-Platform Schematic Capture", Simulation Standard, Vol.10, Number 9, September 1999)
More informationMulti-Ani: A Interface for Animating Multiple Graph Drawing Algorithms
C/SST '{)//nlemalioflal Conference 581 Multi-Ani: A Interface for Animating Multiple Graph Drawing Algorithms Mao Lin Huang Department of Computer Systems Faculty of Information Technology The University
More informationAdding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens
Adding Filtering to Geometric Distortion to Visualize a Clustered Graph on Small Screens Wanchun Li and Masahiro Takatsuka ViSLAB, School of Information Technologies The University of Sydney, NSW, 2006,
More informationA Virtual World for Network Management
A Virtual World for Network Management Steven Feiner Michelle Zhou Laurence Crutcher Aurel Lazar Center for Telecommunications Research Columbia University New York, New York 10027 { feiner, zhou} @cs.columbia.edu
More informationScroll Display: Pointing Device for Palmtop Computers
Asia Pacific Computer Human Interaction 1998 (APCHI 98), Japan, July 15-17, 1998, pp. 243-248, IEEE Computer Society, ISBN 0-8186-8347-3/98 $10.00 (c) 1998 IEEE Scroll Display: Pointing Device for Palmtop
More informationGraph Layout. Last Time: Conveying Structure. Framework for conveying structure. Photographs and illustrations. What is a good view?
Graph Layout Maneesh Agrawala Last Time: Conveying Structure CS 294-10: Visualization Spring 2011 Photographs and illustrations Framework for conveying structure Goal: Expose important internal features
More informationInformation Visualization. Overview. What is Information Visualization? SMD157 Human-Computer Interaction Fall 2003
INSTITUTIONEN FÖR SYSTEMTEKNIK LULEÅ TEKNISKA UNIVERSITET Information Visualization SMD157 Human-Computer Interaction Fall 2003 Dec-1-03 SMD157, Information Visualization 1 L Overview What is information
More informationCS 465 Program 4: Modeller
CS 465 Program 4: Modeller out: 30 October 2004 due: 16 November 2004 1 Introduction In this assignment you will work on a simple 3D modelling system that uses simple primitives and curved surfaces organized
More informationRedefining the Focus and Context of Focus+Context Visualizations
Redefining the Focus and Context of Focus+Context Visualizations Staffan Björk & Johan Redström PLAY: Applied research on art and technology The Interactive Institute, Box 620, SE-405 30 Gothenburg, Sweden
More informationVisualizing Algorithms for the Design and Analysis of Survivable Networks
Visualizing Algorithms for the Design and Analysis of Survivable Networks Ala Eddine Barouni 1, Ali Jaoua 2, and Nejib Zaguia 3 1 University of Tunis, department of computer science, Tunisia ala.barouni@fst.rnu.tn
More informationInformation management - Topic Maps visualization
Information management - Topic Maps visualization Benedicte Le Grand Laboratoire d Informatique de Paris 6, Universite Pierre et Marie Curie, Paris, France Benedicte.Le-Grand@lip6.fr http://www-rp.lip6.fr/~blegrand
More informationFractals: Self-Similarity and Fractal Dimension Math 198, Spring 2013
Fractals: Self-Similarity and Fractal Dimension Math 198, Spring 2013 Background Fractal geometry is one of the most important developments in mathematics in the second half of the 20th century. Fractals
More informationCAD with use of Designers' Intention. Osaka University. Suita, Osaka , Japan. Abstract
CAD with use of Designers' Intention Eiji Arai, Keiichi Shirase, and Hidefumi Wakamatsu Dept. of Manufacturing Science Graduate School of Engineering Osaka University Suita, Osaka 565-0871, Japan Abstract
More informationImproving Suffix Tree Clustering Algorithm for Web Documents
International Conference on Logistics Engineering, Management and Computer Science (LEMCS 2015) Improving Suffix Tree Clustering Algorithm for Web Documents Yan Zhuang Computer Center East China Normal
More informationA Study on Metadata Extraction, Retrieval and 3D Visualization Technologies for Multimedia Data and Its Application to e-learning
A Study on Metadata Extraction, Retrieval and 3D Visualization Technologies for Multimedia Data and Its Application to e-learning Naofumi YOSHIDA In this paper we discuss on multimedia database technologies
More informationSchematics in ArcMap Tutorial
Schematics in ArcMap Tutorial Copyright 1995-2010 Esri All rights reserved. Table of Contents Introducing Schematics in ArcMap Tutorial........................ 3 Exercise 1: Getting familiar with Schematics
More informationMeasurement of Pedestrian Groups Using Subtraction Stereo
Measurement of Pedestrian Groups Using Subtraction Stereo Kenji Terabayashi, Yuki Hashimoto, and Kazunori Umeda Chuo University / CREST, JST, 1-13-27 Kasuga, Bunkyo-ku, Tokyo 112-8551, Japan terabayashi@mech.chuo-u.ac.jp
More informationInformation Visualization. Jing Yang Fall Hierarchy and Tree Visualization
Information Visualization Jing Yang Fall 2007 1 Hierarchy and Tree Visualization 2 1 Hierarchies Definition An ordering of groups in which larger groups encompass sets of smaller groups. Data repository
More informationMapping Visualization of Web Page Structure
Mapping Visualization of Web Page Structure Hyung-Suk Kim Electrical Engineering Department Stanford University Stanford, CA 94305 USA hskim08@stanford.edu Juho Kim Computer Science Department Stanford
More informationDrawing Problem. Possible properties Minimum number of edge crossings Small area Straight or short edges Good representation of graph structure...
Graph Drawing Embedding Embedding For a given graph G = (V, E), an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates.
More informationA Sketch Interpreter System with Shading and Cross Section Lines
Journal for Geometry and Graphics Volume 9 (2005), No. 2, 177 189. A Sketch Interpreter System with Shading and Cross Section Lines Kunio Kondo 1, Haruki Shizuka 1, Weizhong Liu 1, Koichi Matsuda 2 1 Dept.
More informationThree-Dimensional Feature Diagrams Visualization
Three-Dimensional Feature Diagrams Visualization Pablo Trinidad, Antonio Ruiz Cortés, David Benavides, Sergio Segura Dpto. Lenguajes y Sistemas Informáticos University of Seville {ptrinidad,aruiz,benavides,sergiosegura}
More informationVISUALIZING TREES AND GRAPHS. Petra Isenberg
VISUALIZING TREES AND GRAPHS Petra Isenberg RECAP you have learned about simple plots multi-attribute data visualization DATA AND ITS STRUCTURE STRUCTURED DATA UNSTRUCTURED DATA STRUCTURED DATA there are
More informationGraph Drawing Contest Report
Graph Drawing Contest Report Christian A. Duncan 1, Carsten Gutwenger 2,LevNachmanson 3, and Georg Sander 4 1 Louisiana Tech University, Ruston, LA 71272, USA duncan@latech.edu 2 University of Dortmund,
More informationImproving Adaptive Hypermedia by Adding Semantics
Improving Adaptive Hypermedia by Adding Semantics Anton ANDREJKO Slovak University of Technology Faculty of Informatics and Information Technologies Ilkovičova 3, 842 16 Bratislava, Slovak republic andrejko@fiit.stuba.sk
More informationOptimum Alphabetic Binary Trees T. C. Hu and J. D. Morgenthaler Department of Computer Science and Engineering, School of Engineering, University of C
Optimum Alphabetic Binary Trees T. C. Hu and J. D. Morgenthaler Department of Computer Science and Engineering, School of Engineering, University of California, San Diego CA 92093{0114, USA Abstract. We
More informationTHE DEGREE OF POLYNOMIAL CURVES WITH A FRACTAL GEOMETRIC VIEW
225 THE DEGREE OF POLYNOMIAL CURVES WITH A FRACTAL GEOMETRIC VIEW S. Mohanty 1 and A. Misra 2 1 Department of Computer Science and Applications, Utkal University, Bhubaneswar-751004, INDIA. 2 Silicon Institute
More informationTHE IMPLEMENTATION OF A DISTRIBUTED FILE SYSTEM SUPPORTING THE PARALLEL WORLD MODEL. Jun Sun, Yasushi Shinjo and Kozo Itano
THE IMPLEMENTATION OF A DISTRIBUTED FILE SYSTEM SUPPORTING THE PARALLEL WORLD MODEL Jun Sun, Yasushi Shinjo and Kozo Itano Institute of Information Sciences and Electronics University of Tsukuba Tsukuba,
More informationProgress in Image Analysis and Processing III, pp , World Scientic, Singapore, AUTOMATIC INTERPRETATION OF FLOOR PLANS USING
Progress in Image Analysis and Processing III, pp. 233-240, World Scientic, Singapore, 1994. 1 AUTOMATIC INTERPRETATION OF FLOOR PLANS USING SPATIAL INDEXING HANAN SAMET AYA SOFFER Computer Science Department
More informationimindmap Quick Start Guide PC Users
imindmap Quick Start Guide PC Users ThinkBuzan Ltd. CREATING YOUR FIRST MIND MAP This guide is designed as a quick starting point for learning how to use imindmap. Simply follow the basic step-by-step
More informationThe questions will be short answer, similar to the problems you have done on the homework
Introduction The following highlights are provided to give you an indication of the topics that you should be knowledgeable about for the midterm. This sheet is not a substitute for the homework and the
More informationInformation Gathering Support Interface by the Overview Presentation of Web Search Results
Information Gathering Support Interface by the Overview Presentation of Web Search Results Takumi Kobayashi Kazuo Misue Buntarou Shizuki Jiro Tanaka Graduate School of Systems and Information Engineering
More informationBinary Trees
Binary Trees 4-7-2005 Opening Discussion What did we talk about last class? Do you have any code to show? Do you have any questions about the assignment? What is a Tree? You are all familiar with what
More information1. Introduction to Constructive Solid Geometry (CSG)
opyright@010, YZU Optimal Design Laboratory. All rights reserved. Last updated: Yeh-Liang Hsu (010-1-10). Note: This is the course material for ME550 Geometric modeling and computer graphics, Yuan Ze University.
More informationBasic Consideration of Structures with Fractal Properties and Their Mechanical Characteristics
Original Paper Forma, 15, 113 119, 2000 Basic Consideration of Structures with Fractal Properties and Their Mechanical Characteristics Naoko KISHIMOTO* and M. C. NATORI The Institute of Space and Astronautical
More informationDigital Halftoning Algorithm Based o Space-Filling Curve
JAIST Reposi https://dspace.j Title Digital Halftoning Algorithm Based o Space-Filling Curve Author(s)ASANO, Tetsuo Citation IEICE TRANSACTIONS on Fundamentals o Electronics, Communications and Comp Sciences,
More informationCloth Simulation. Tanja Munz. Master of Science Computer Animation and Visual Effects. CGI Techniques Report
Cloth Simulation CGI Techniques Report Tanja Munz Master of Science Computer Animation and Visual Effects 21st November, 2014 Abstract Cloth simulation is a wide and popular area of research. First papers
More informationNavigating Product Catalogs Through OFDAV Graph Visualization
Navigating Product Catalogs Through OFDAV Graph Visualization Mao Lin Huang Department of Computer Systems Faculty of Information Technology University of Technology, Sydney NSW 2007, Australia maolin@it.uts.edu.au
More informationHigres Visualization System for Clustered Graphs and Graph Algorithms
Higres Visualization System for Clustered Graphs and Graph Algorithms Ivan A. Lisitsyn and Victor N. Kasyanov A. P. Ershov s Institute of Informatics Systems, Lavrentiev av. 6, 630090, Novosibirsk, Russia
More informationCS350: Data Structures Red-Black Trees
Red-Black Trees James Moscola Department of Engineering & Computer Science York College of Pennsylvania James Moscola Red-Black Tree An alternative to AVL trees Insertion can be done in a bottom-up or
More informationINTERACTIVE ENVIRONMENT FOR INTUITIVE UNDERSTANDING OF 4D DATA. M. Murata and S. Hashimoto Humanoid Robotics Institute, Waseda University, Japan
1 INTRODUCTION INTERACTIVE ENVIRONMENT FOR INTUITIVE UNDERSTANDING OF 4D DATA M. Murata and S. Hashimoto Humanoid Robotics Institute, Waseda University, Japan Abstract: We present a new virtual reality
More informationTechniques. IDSIA, Istituto Dalle Molle di Studi sull'intelligenza Articiale. Phone: Fax:
Incorporating Learning in Motion Planning Techniques Luca Maria Gambardella and Marc Haex IDSIA, Istituto Dalle Molle di Studi sull'intelligenza Articiale Corso Elvezia 36 - CH - 6900 Lugano Phone: +41
More informationNavigating Large Hierarchical Space Using Invisible Links
Navigating Large Hierarchical Space Using Invisible Links Ming C. Hao, Meichun Hsu, Umesh Dayal, Adrian Krug* Software Technology Laboratory HP Laboratories Palo Alto HPL-2000-8 January, 2000 E-mail:(mhao,
More informationMaya Lesson 3 Temple Base & Columns
Maya Lesson 3 Temple Base & Columns Make a new Folder inside your Computer Animation Folder and name it: Temple Save using Save As, and select Incremental Save, with 5 Saves. Name: Lesson3Temple YourName.ma
More informationNavigating Clustered Graphs
Navigating Clustered Graphs by Wanchun Li Bachelor Engineering, 1992 A thesis submitted to The School of Information Technologies The University of Sydney for the degree of MASTER OF SCIENCE January, 2005
More informationAN APPROACH FOR GRAPHICAL USER INTERFACE DEVELOPMENT FOR STEREOSCOPIC VISUALIZATION SYSTEM
AN APPROACH FOR GRAPHICAL USER INTERFACE DEVELOPMENT FOR STEREOSCOPIC VISUALIZATION SYSTEM Rositsa R. Radoeva St. Cyril and St. Methodius University of Veliko Tarnovo, ABSTRACT Human-computer interaction
More informationif you have anything on the screen you can clear it by pressing: CLEAR
Graphing Calculators are really very powerful hand held computing devices. The allow mathematics problems to be investigated by those whose learning styles range from the symbolic to the visual to the
More informationOpenForms360 Validation User Guide Notable Solutions Inc.
OpenForms360 Validation User Guide 2011 Notable Solutions Inc. 1 T A B L E O F C O N T EN T S Introduction...5 What is OpenForms360 Validation?... 5 Using OpenForms360 Validation... 5 Features at a glance...
More information3.2 A Three-Bar Linkage 51
3.2 A Three-Bar Linkage 51 It may happen that the drawing in Euclidean view is too big or too small. You can use the zooming tools to change this. There is a Zoom-In and a Zoom-Out tool below the Euclidean
More informationGraph and Tree Layout
CS8B :: Nov Graph and Tree Layout Topics Graph and Tree Visualization Tree Layout Graph Layout Jeffrey Heer Stanford University Goals Overview of layout approaches and their strengths and weaknesses Insight
More informationA CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION
CO-182 A CONSISTENCY MAINTENANCE OF SHARED BOUNDARY AFTER POLYGON GENERALIZATION AI T.(1), ZHANG W.(2) (1) Wuhan University, WUHAN CITY, CHINA ; (2) Zhongnan University of Economics and Law, WUHAN CITY,
More informationManipulating Screen Space with StretchTools: Visualizing Large Structure on Small Screen. Manojit Sarkar and Steven P. Reiss
Manipulating Screen Space with StretchTools: Visualizing Large Structure on Small Screen Manojit Sarkar and Steven P. Reiss Department of Computer Science Brown University Providence, Rhode Island 02912
More informationA Robot Recognizing Everyday Objects
A Robot Recognizing Everyday Objects -- Towards Robot as Autonomous Knowledge Media -- Hideaki Takeda Atsushi Ueno Motoki Saji, Tsuyoshi Nakano Kei Miyamato The National Institute of Informatics Nara Institute
More informationKnowledge Discovery from Web Usage Data: Research and Development of Web Access Pattern Tree Based Sequential Pattern Mining Techniques: A Survey
Knowledge Discovery from Web Usage Data: Research and Development of Web Access Pattern Tree Based Sequential Pattern Mining Techniques: A Survey G. Shivaprasad, N. V. Subbareddy and U. Dinesh Acharya
More informationChapter Two. Lesson A. Objectives. Exploring the UNIX File System and File Security. Understanding Files and Directories
Chapter Two Exploring the UNIX File System and File Security Lesson A Understanding Files and Directories 2 Objectives Discuss and explain the UNIX file system Define a UNIX file system partition Use the
More informationMFTV: A Zoomable Multifaceted Tree Viewer
MFTV: A Zoomable Multifaceted Tree Viewer Nizar Habash Computer Science Department University of Maryland College Park MD 20740 USA +1 301 405 6746 habash@cs.umd.edu ABSTRACT In this paper, we describe
More informationGraph Layout Adjustment Strategies
Graph Layout Adjustment Strategies Margaret-Anne D. Storey 12 and Hausi A. Miiller 2 1 School of Computing Science, Simon Fraser University, Burnaby, BC, Canada. 2 Department of Computer Science, University
More informationProceedings of the Second Australasian User Interface Conference AUIC 2001
Goldleaf hierarchical document browser Author Faichney, Jolon, Gonzalez, Ruben Published 2001 Conference Title Proceedings of the Second Australasian User Interface Conference AUIC 2001 DOI https://doi.org/10.1109/auic.2001.906271
More informationOVERVIEW AND DETAIL FOCUS+CONTEXT. Information Visualization Fall 2009 Jinwook Seo SNU CSE
OVERVIEW AND DETAIL FOCUS+CONTEXT Information Visualization Fall 2009 Jinwook Seo SNU CSE Readings A review of overview+detail, zooming, and focus+context interfaces. Andy Cockburn, Amy Karlson, and Benjamin
More informationComplexity is around us. Part one: the chaos game
Complexity is around us. Part one: the chaos game Dawid Lubiszewski Complex phenomena like structures or processes are intriguing scientists around the world. There are many reasons why complexity is a
More informationDynamic Information Visualization Using 3D Metaphoric Worlds
Dynamic Information Visualization Using 3D Metaphoric Worlds C. Russo Dos Santos, P. Gros, and P. Abel Multimedia Dept. Eurécom Institute 2229, Route des Crêtes 06904 Sophia-Antipolis, France email: {cristina.russo,pascal.gros,pierre.abel}@eurecom.fr
More informationAn AVL tree with N nodes is an excellent data. The Big-Oh analysis shows that most operations finish within O(log N) time
B + -TREES MOTIVATION An AVL tree with N nodes is an excellent data structure for searching, indexing, etc. The Big-Oh analysis shows that most operations finish within O(log N) time The theoretical conclusion
More informationOptimal Region for Binary Search Tree, Rotation and Polytope
Optimal Region for Binary Search Tree, Rotation and Polytope Kensuke Onishi Mamoru Hoshi 2 Department of Mathematical Sciences, School of Science Tokai University, 7 Kitakaname, Hiratsuka, Kanagawa, 259-292,
More informationA Fully Animated Interactive System for Clustering and Navigating Huge Graphs
A Fully Animated Interactive System for Clustering and Navigating Huge Graphs Mao Lin Huang and Peter Eades Department of Computer Science and Software Engineering The University of Newcastle, NSW 2308,
More informationUI Elements. If you are not working in 2D mode, you need to change the texture type to Sprite (2D and UI)
UI Elements 1 2D Sprites If you are not working in 2D mode, you need to change the texture type to Sprite (2D and UI) Change Sprite Mode based on how many images are contained in your texture If you are
More informationRay Trace Notes. Charles Rino. September 2010
Ray Trace Notes Charles Rino September 2010 1 Introduction A MATLAB function that performs a direct numerical integration to the ray optics equation described in book Section 1.3.2 has been implemented.
More informationCOMPUTER GRAPHICS ANIMATION FOR CONSTRUCTION MANAGEMENT
COMPUTER GRAPHICS ANIMATION FOR CONSTRUCTION MANAGEMENT Yoshihiko FUKUCHI *, Ichiro KOBAYASHI ** ABSTRACT : Computer graphics animation systems provide the ability to integrate on-site engineers* expertise
More informationENVI Tutorial: Introduction to ENVI
ENVI Tutorial: Introduction to ENVI Table of Contents OVERVIEW OF THIS TUTORIAL...1 GETTING STARTED WITH ENVI...1 Starting ENVI...1 Starting ENVI on Windows Machines...1 Starting ENVI in UNIX...1 Starting
More informationSphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D
Sphere Anchored Map: A Visualization Technique for Bipartite Graphs in 3D Takao Ito, Kazuo Misue and Jiro Tanaka Department of Computer Science, University of Tsukuba, Tennodai, Tsukuba, 305-8577 Ibaraki,
More informationCS301 - Data Structures Glossary By
CS301 - Data Structures Glossary By Abstract Data Type : A set of data values and associated operations that are precisely specified independent of any particular implementation. Also known as ADT Algorithm
More informationEgemen Tanin, Tahsin M. Kurc, Cevdet Aykanat, Bulent Ozguc. Abstract. Direct Volume Rendering (DVR) is a powerful technique for
Comparison of Two Image-Space Subdivision Algorithms for Direct Volume Rendering on Distributed-Memory Multicomputers Egemen Tanin, Tahsin M. Kurc, Cevdet Aykanat, Bulent Ozguc Dept. of Computer Eng. and
More informationArcView QuickStart Guide. Contents. The ArcView Screen. Elements of an ArcView Project. Creating an ArcView Project. Adding Themes to Views
ArcView QuickStart Guide Page 1 ArcView QuickStart Guide Contents The ArcView Screen Elements of an ArcView Project Creating an ArcView Project Adding Themes to Views Zoom and Pan Tools Querying Themes
More informationNEURAL NETWORK VISUALIZATION
Neural Network Visualization 465 NEURAL NETWORK VISUALIZATION Jakub Wejchert Gerald Tesauro IB M Research T.J. Watson Research Center Yorktown Heights NY 10598 ABSTRACT We have developed graphics to visualize
More informationProject Participants
Annual Report for Period:10/2004-10/2005 Submitted on: 06/21/2005 Principal Investigator: Yang, Li. Award ID: 0414857 Organization: Western Michigan Univ Title: Projection and Interactive Exploration of
More informationWhat We Can Learn From SILK and DENIM
What We Can Learn From SILK and DENIM Presenter: Shahla Almasri COMP 762B: Modelling and Simulation Based Design March 2 nd, 2005 Main References This presentation is based on the following four papers:
More informationIAT 355 Intro to Visual Analytics Graphs, trees and networks 2. Lyn Bartram
IAT 355 Intro to Visual Analytics Graphs, trees and networks 2 Lyn Bartram Graphs and Trees: Connected Data Graph Vertex/node with one or more edges connecting it to another node Cyclic or acyclic Edge
More informationCreating a Basic Chart in Excel 2007
Creating a Basic Chart in Excel 2007 A chart is a pictorial representation of the data you enter in a worksheet. Often, a chart can be a more descriptive way of representing your data. As a result, those
More informationReinforcement Control via Heuristic Dynamic Programming. K. Wendy Tang and Govardhan Srikant. and
Reinforcement Control via Heuristic Dynamic Programming K. Wendy Tang and Govardhan Srikant wtang@ee.sunysb.edu and gsrikant@ee.sunysb.edu Department of Electrical Engineering SUNY at Stony Brook, Stony
More information