https://infovis-wiki.net/w/api.php?action=feedcontributions&feedformat=atom&user=UE-InfoVis07-01 2026-05-30T05:44:29Z User contributions MediaWiki 1.45.3 https://infovis-wiki.net/w/index.php?title=Dai,_Guozhong&diff=13920 2007-06-06T13:04:10Z

<p>UE-InfoVis07-01: </p> <hr /> <div>[[Image:Dai1.jpg]]<br /> <br /> == Personal Information ==<br /> <br /> Birthday: September 6, 1944 &lt;br&gt;<br /> Place of birth: Jiangsu Wuxi &lt;br&gt;<br /> Education: &lt;br&gt;<br /> 1962-1967 China science and technology university &lt;br&gt;<br /> 1982-1985 Maryland University, USA: visiting scholar<br /> <br /> Information: [IEL]<br /> <br /> == Current Affiliation ==<br /> Intelligence Engineering Lab, Institute of Software, Chinese Academy of Sciences: PH.D. Advisor &lt;br&gt;<br /> State Key Lab. of Computer Science<br /> <br /> == External Links ==<br /> [http://iel.iscas.ac.cn/english_resion/people.htm IEL Staff] &lt;br&gt;<br /> [http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/d/Dai:Guozhong.html List of publications (DBLP)]<br /> <br /> == References ==<br /> [IEL] IEL Website: Personal Information about G. Dai. Retrieved: April 14th, 2007. http://iel.iscas.ac.cn/lab_cultive/lab_cultive_mendordai.htm &lt;br&gt;<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Persons]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13469 2007-04-25T14:27:05Z

<p>UE-InfoVis07-01: /* Suitable Datatypes */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large amounts of hierarchically structured data. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed this layout algorithm for tree structures: Tangent circles represent brother nodes at the same level; to visualize the hierarchy, all children of a node are packed into that node (and thus determine its size). The size of a leaf-node can represent an arbitrary property, such as file size. An advantage of this algorithm is the good overview of large data sets and the clear representation of groupings and structural relationships.<br /> <br /> As a space-filling technique, Circle Packing visualizes information as spatial extension. The algorithm on which it is based is related to the mathematical problem with the same name ([http://en.wikipedia.org/wiki/Sphere_packing#Circle_packing Wikipedia article]). It places any number of brother nodes, represented by circles, in an arrangement that has a high density and retains a convex shape approximating a circle as the amount of nodes grows. Due to this property, a set of brother nodes can always be packed into its (also circle-shaped) parent node.<br /> <br /> Compared to that of [[Treemap|treemaps]], a visualization generated by this technique is - while possibly a bit less space-efficient - easier to comprehend visually while it retains the ability to (theoretically) display all hierarchies at once. This, of course, requires an apt user interface to easily zoom into the structure if that is required to see the leaf nodes in detail.<br /> <br /> The authors have also demonstrated an extension of the visualization into the third dimension by using cylinders with a height value representing the level of a node.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13468 2007-04-25T14:26:08Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large amounts of hierarchically structured data. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed this layout algorithm for tree structures: Tangent circles represent brother nodes at the same level; to visualize the hierarchy, all children of a node are packed into that node (and thus determine its size). The size of a leaf-node can represent an arbitrary property, such as file size. An advantage of this algorithm is the good overview of large data sets and the clear representation of groupings and structural relationships.<br /> <br /> As a space-filling technique, Circle Packing visualizes information as spatial extension. The algorithm on which it is based is related to the mathematical problem with the same name ([http://en.wikipedia.org/wiki/Sphere_packing#Circle_packing Wikipedia article]). It places any number of brother nodes, represented by circles, in an arrangement that has a high density and retains a convex shape approximating a circle as the amount of nodes grows. Due to this property, a set of brother nodes can always be packed into its (also circle-shaped) parent node.<br /> <br /> Compared to that of [[Treemap|treemaps]], a visualization generated by this technique is - while possibly a bit less space-efficient - easier to comprehend visually while it retains the ability to (theoretically) display all hierarchies at once. This, of course, requires an apt user interface to easily zoom into the structure if that is required to see the leaf nodes in detail.<br /> <br /> The authors have also demonstrated an extension of the visualization into the third dimension by using cylinders with a height value representing the level of a node.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13467 2007-04-25T14:05:04Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large amounts of hierarchically structured data. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed this layout algorithm for tree structures: Tangent circles represent brother nodes at the same level; to visualize the hierarchy, all children of a node are packed into that node (and thus determine its size). The size of a leaf-node can represent an arbitrary property, such as file size. An advantage of this algorithm is the good overview of large data sets and the clear representation of groupings and structural relationships.<br /> <br /> As a space-filling technique, Circle Packing visualizes information as spatial extension. The algorithm on which it is based is related to the mathematical problem with the same name ([http://en.wikipedia.org/wiki/Sphere_packing#Circle_packing Wikipedia article]). It places brother nodes (represented by circles) in an arrangement that has a high density and retains a convex shape (approximating a circle as the number of nodes grows), regardless of the number of nodes. Due to this property, a set of brother nodes can always be packed into its circle-shaped parent node.<br /> <br /> Compared to that of [[Treemap|treemaps]], a visualization generated by this technique is - while possibly a bit less space-efficient - easier to comprehend visually while it retains the ability to (theoretically) display all hierarchies at once. This, of course, requires an apt user interface to easily zoom into the structure if that is required to see the leaf nodes in detail.<br /> <br /> The authors have also demonstrated an extension of the visualization into the third dimension by using cylinders with a height value representing the level of a node.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13464 2007-04-25T14:02:57Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large amounts of hierarchically structured data. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed this layout algorithm for tree structures: Tangent circles represent brother nodes at the same level; to visualize the hierarchy, all children of a node are packed into that node (and thus determine its size). The size of a leaf-node can represent an arbitrary property, such as file size. An advantage of this algorithm is the good overview of large data sets and the clear representation of groupings and structural relationships.<br /> <br /> As a space-filling technique, Circle Packing visualizes information as spatial extension. The algorithm on which it is based is related to the mathematical problem with the same name ([http://en.wikipedia.org/wiki/Sphere_packing#Circle_packing Wikipedia article]). It places brother nodes (represented by circles) in an arrangement that has a high density and retains a convex shape, regardless of the number of nodes. Due to this property, a set of brother nodes can always be packed into its circle-shaped parent node.<br /> <br /> Compared to that of [[Treemap|treemaps]], a visualization generated by this technique is - while possibly a bit less space-efficient - easier to comprehend visually while it retains the ability to (theoretically) display all hierarchies at once. This, of course, requires an apt user interface to easily zoom into the structure if that is required to see the leaf nodes in detail.<br /> <br /> The authors have also demonstrated an extension of the visualization into the third dimension by using cylinders with a height value representing the level of a node.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13460 2007-04-25T13:57:45Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large amounts of hierarchically structured data. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed this layout algorithm for tree structures: Tangent circles represent brother nodes at the same level; to visualize the hierarchy, all children of a node are packed into that node (and thus determine its size). The size of a leaf-node can represent an arbitrary property, such as file size. An advantage of this algorithm is the good overview of large data sets and the clear representation of groupings and structural relationships.<br /> <br /> As a space-filling technique, Circle Packing visualizes information as spatial extension. The algorithm on which it is based is related to the mathematical problem with the same name ([http://en.wikipedia.org/wiki/Sphere_packing#Circle_packing Wikipedia article]). It places brother nodes (represented by circles) in an arrangement that has a high density and retains a convex shape, regardless of the number of nodes. Due to this property, a set of brother nodes can always be packed into its circle-shaped parent node.<br /> <br /> Compared to that of [[Treemap|treemaps]], a visualization generated by this technique is - while possibly a bit less space-efficient - easier to comprehend visually while it retains the ability to (theoretically) display all hierarchies at once. This, of course, requires an apt user interface to easily zoom into the structure if that is required to see the leaf nodes in detail.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13431 2007-04-25T11:41:57Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview of large data sets. Tangent circles represent the brother nodes at the same level. The different levels are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview of large amounts of hierarchically structured data and the clear representation of groupings and structural relationships.<br /> <br /> Circle packing is a space-filling technique, i.e. it visualizes data as spatial extension. The algorithm on which it is based is related to the mathematical problem with the same name ([http://en.wikipedia.org/wiki/Sphere_packing#Circle_packing Wikipedia article]). It places brother nodes (represented by circles) in an arrangement that has a high density and retains a convex shape, regardless of the number of nodes. Due to this property, a set of brother nodes can always be packed into its circle-shaped parent node.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13430 2007-04-25T11:41:31Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview of large data sets. Tangent circles represent the brother nodes at the same level. The different levels are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview of large amounts of hierarchically structured data and the clear representation of groupings and structural relationships.<br /> <br /> Circle packing is a space-filling technique, i.e. it visualizes data as spatial extension. The algorithm on which it is based is related to the mathematical problem with the same name ([[http://en.wikipedia.org/wiki/Sphere_packing#Circle_packing Wikipedia article). It places brother nodes (represented by circles) in an arrangement that has a high density and retains a convex shape, regardless of the number of nodes. Due to this property, a set of brother nodes can always be packed into its circle-shaped parent node.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13429 2007-04-25T11:34:47Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview of large data sets. Tangent circles represent the brother nodes at the same level. The different levels are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview of large amounts of hierarchically structured data and the clear representation of groupings and structural relationships.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13428 2007-04-25T11:33:53Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [[Treemap|treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13427 2007-04-25T11:33:32Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [[Treemap]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13426 2007-04-25T11:33:25Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [Treemap]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13425 2007-04-25T11:33:20Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [Ttreemap]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13424 2007-04-25T11:32:57Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by [[treemaps]] and [http://www.grokker.com Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13423 2007-04-25T11:32:22Z

<p>UE-InfoVis07-01: /* Short description */</p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by �[[treemaps]] and [http://www.grokker.com|Grokker], Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13407 2007-04-24T11:33:32Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13406 2007-04-24T11:31:46Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback was a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13405 2007-04-24T11:31:32Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback gave a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13404 2007-04-24T11:31:13Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback showed a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> == Evaluation Reference ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13403 2007-04-24T11:30:35Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback showed a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> <br /> Mentioned advantages:<br /> <br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> <br /> Mentioned disadvantages:<br /> <br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> [Wang, W. et al., 2006]<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13402 2007-04-24T11:29:46Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback showed a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> Mentioned advantages:<br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> Mentioned disadvantages:<br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> [Wang, W. et al., 2006]<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13401 2007-04-24T11:29:24Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> == Evaluation ==<br /> <br /> Twenty-one students tested the file visualization tool for two weeks. Their feedback showed a 67 percent positive rating, a 22 percent neutral rating and a 11 percent negative rating.<br /> <br /> Mentioned advantages:<br /> *robust and efficient for thousands of files<br /> *friendly interface which is easy to use<br /> *interface needs less operation than traditional files management systems to find a file<br /> *user interface has a high efficiency<br /> *clear bird view of the whole files<br /> *quickly zoom in/out<br /> <br /> Mentioned disadvantages:<br /> *difficult to display a long file name fully<br /> *no file names shown in 3D view<br /> *difficult to do copy/paste-operations<br /> <br /> [Wang, W. et al., 2006]<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13400 2007-04-24T10:57:00Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> == Evaluation ==<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com. Grokker]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13399 2007-04-24T10:56:23Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> == Evaluation ==<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> [grokker] [http://www.grokker.com]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13398 2007-04-24T10:55:16Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> == Evaluation ==<br /> <br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13397 2007-04-24T10:52:19Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> {{Quotation|The layout algorithm for tree visualization leads to a simultaneously clearer and more compact visualization of a hierarchy than rectangular views and node-link diagrams. The visualization has the advantage over retangular layouts of allowing even very small nodes to remain visible without contorted aspect ratios. Though the use of display space is not more efficient than rectangular layouts, the space is helpful to see structural relationships and is easy to select (click) a node.| [Wang, W. et al., 2006]}}<br /> <br /> == Evaluation ==<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13396 2007-04-24T10:46:59Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> <br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> <br /> == Evaluation ==<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13395 2007-04-24T10:46:36Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> <br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> <br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Evaluation ==<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13394 2007-04-24T10:45:44Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> Packing circles with random radii. The shape is basically convex.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large <br /> hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is <br /> visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Evaluation ==<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13393 2007-04-24T10:44:45Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> Packing circles with random radii.<br /> <br /> <br /> [[Image:Convex.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> Userinterface: directories are represented by white circles. &lt;br/&gt;<br /> The Color of the inner circles shows the filetype and the file sizes determine the radii.<br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> == Suitable Datatypes ==<br /> Suitable Datatypes for this visualization technique are (large) hierarchical data structures.<br /> <br /> == Important Citations ==<br /> <br /> {{Quotation|The visualization of hierarchical information structures is an important topic in the visualization community. Most of the work concentrated on the challenge to display large <br /> hierarchies in a comprehensible form.| [Wang, W. et al., 2006]}}<br /> <br /> {{Quotation|The circles of different radii are suitable for representing large numbers of brother nodes. There is no overlapping between any two circles, which ensures each circle is <br /> visible. The circles are to be packed as close as possible to save display space. A new circle is always placed outside the front-chain and beside the circle whose center is nearest to the origin, which ensures that the shape of front-chain is basically convex like a circle.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == Evaluation ==<br /> <br /> <br /> == Internal Links ==<br /> *[[Treemap]]<br /> <br /> <br /> == External Links ==<br /> <br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=File:Convex.gif&diff=13392 2007-04-24T10:43:36Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Summary ==<br /> <br /> == Copyright status ==<br /> unknown<br /> == Source ==<br /> http://portal.acm.org/citation.cfm?doid=1124772.1124851</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13380 2007-04-23T20:30:23Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13379 2007-04-23T20:30:06Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> <br /> 3D nested cylinders and spheres &lt;br/&gt;<br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13378 2007-04-23T20:28:01Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> The tree nodes at different levels are represented by nested circles. Brother nodes are packed into the root node. If a node has children they are packed into it. &lt;br/&gt;<br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13377 2007-04-23T20:02:26Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> [Wang, W. et al. 2006] [http://portal.acm.org/citation.cfm?doid=1124772.1124851 Wang et al. Visualization of large hierarchical data by circle packing.] In ''Proceedings of the SIGCHI conference on Human Factors in computing systems'', pages 517-520, Montréal, Québec, Canada, 2006: ACM Press.<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13376 2007-04-23T20:00:20Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13375 2007-04-23T19:59:59Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Wang, W. et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> <br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> <br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13374 2007-04-23T19:59:24Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Hongan Wang et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> &lt;br/&gt;<br /> [[Image:3d_example.gif]] &lt;br/&gt;<br /> &lt;br/&gt;<br /> [[Image:detail_example.gif]] &lt;br/&gt;<br /> &lt;br/&gt;<br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13373 2007-04-23T19:59:03Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Hongan Wang et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> [[Image:Nodes.jpg]] &lt;br/&gt;<br /> [[Image:3d_example.gif]]<br /> [[Image:detail_example.gif]]<br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=File:Detail_example.gif&diff=13372 2007-04-23T19:55:51Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Summary ==<br /> <br /> == Copyright status ==<br /> unknown<br /> == Source ==<br /> http://portal.acm.org/citation.cfm?doid=1124772.1124851</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=File:3d_example.gif&diff=13371 2007-04-23T19:55:39Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Summary ==<br /> <br /> == Copyright status ==<br /> unknown<br /> == Source ==<br /> http://portal.acm.org/citation.cfm?doid=1124772.1124851</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13370 2007-04-23T19:53:32Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Hongan Wang et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> [[Image:Nodes.jpg]]<br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=File:Nodes.jpg&diff=13369 2007-04-23T19:52:46Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Summary ==<br /> <br /> == Copyright status ==<br /> unknown<br /> == Source ==<br /> http://portal.acm.org/citation.cfm?doid=1124772.1124851</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13368 2007-04-23T19:51:32Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> {{Quotation|Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.| [Hongan Wang et al., 2006]}}<br /> <br /> <br /> == figures ==<br /> <br /> <br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13367 2007-04-23T19:46:53Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Inspired by treemaps and Grokker, Wang et al. developed a layout algorithm for tree structures which gives a good overview for large data sets. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == figures ==<br /> <br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13366 2007-04-23T19:44:52Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == figures ==<br /> <br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Treemap]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13365 2007-04-23T19:00:11Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical data using nested circles. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == figures ==<br /> <br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Dynamic query]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13364 2007-04-23T18:57:17Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical date using nested circles. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == figures ==<br /> <br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Dynamic query]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=1124851&amp;coll=GUIDE&amp;dl=GUIDE&amp;CFID=20762537&amp;CFTOKEN=32865372<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13363 2007-04-23T18:44:43Z

<p>UE-InfoVis07-01: </p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical date using nested circles. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.<br /> <br /> == figures ==<br /> <br /> <br /> <br /> <br /> == Suitable Datatypes ==<br /> * <br /> <br /> == Example and use cases ==<br /> Dynamic queries allow users to formulate queries by adjusting graphical widgets, such as slider, and see the results immediately. <br /> By providing a graphical visualization of the database and search results. Users can easliy change the parameters for search.<br /> The interfaces were used to explore a real-estate database and find homes meeting specific search criteria. <br /> <br /> <br /> ==Internal Links==<br /> *[[Dynamic query]]<br /> <br /> == References ==<br /> *[ACM, 1992] ACM, I ACM Press New York, http://portal.acm.org/citation.cfm?id=133216<br /> <br /> [[Category:Techniques]]</div>

UE-InfoVis07-01 https://infovis-wiki.net/w/index.php?title=Circle_Packing&diff=13361 2007-04-23T18:29:47Z

<p>UE-InfoVis07-01: /* Authors */</p> <hr /> <div>== Authors ==<br /> *[[Wang%2C_Hongan|Hongan Wang]] &lt;br/&gt;<br /> *[[Dai%2C_Guozhong|Guozhong Dai]]&lt;br/&gt;<br /> *Weixin Wang&lt;br/&gt;<br /> *Hui Wang&lt;br/&gt;<br /> <br /> == Short description ==<br /> <br /> Circle packing is a method to visualize large hierarchical date using nested circles. Tangent circles represent the brother nodes at the same level. The different leves are shown by nested circles (2D) or nested cylinders (3D). An advantage of this algorithm is the good overview for large data sets and it is easy to make out groupings and structural relationships.</div>

UE-InfoVis07-01