Circle Packing - Revision history

UE-InfoVis07-01: /* Suitable Datatypes */

2007-04-25T14:27:05Z

Suitable Datatypes

← Older revision		Revision as of 14:27, 25 April 2007
Line 46:		Line 46:

	Suitable Datatypes for this visualization technique are (large) hierarchical data structures.		Suitable Datatypes for this visualization technique are (large) hierarchical data structures.


	== Important Citations ==		== Important Citations ==

UE-InfoVis07-01: /* Short description */

2007-04-25T14:26:08Z

Short description

← Older revision		Revision as of 14:26, 25 April 2007
Line 10:		Line 10:
	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.		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.

	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.		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.

	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.		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.

UE-InfoVis07-01: /* Short description */

2007-04-25T14:05:04Z

Short description

← Older revision		Revision as of 14:05, 25 April 2007
Line 10:		Line 10:
	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.		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.

	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.		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.

	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.		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.

UE-InfoVis07-01: /* Short description */

2007-04-25T14:02:57Z

Short description

← Older revision		Revision as of 14:02, 25 April 2007
Line 13:		Line 13:

	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.		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.

			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.

	== Figures ==		== Figures ==

UE-InfoVis07-01: /* Short description */

2007-04-25T13:57:45Z

Short description

← Older revision		Revision as of 13:57, 25 April 2007
Line 8:		Line 8:
	== Short description ==		== Short description ==

	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.		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.

	~~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.		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.

			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.

	== Figures ==		== Figures ==

UE-InfoVis07-01: /* Short description */

2007-04-25T11:41:57Z

Short description

← Older revision		Revision as of 11:41, 25 April 2007
Line 10:		Line 10:
	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.		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.

	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.		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.

	== Figures ==		== Figures ==

UE-InfoVis07-01: /* Short description */

2007-04-25T11:41:31Z

Short description

← Older revision		Revision as of 11:41, 25 April 2007
Line 9:		Line 9:

	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.		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.

			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.

	== Figures ==		== Figures ==

UE-InfoVis07-01: /* Short description */

2007-04-25T11:34:47Z

Short description

← Older revision		Revision as of 11:34, 25 April 2007
Line 8:		Line 8:
	== Short description ==		== Short description ==

	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.		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.

	== Figures ==		== Figures ==

UE-InfoVis07-01: /* Short description */

2007-04-25T11:33:53Z

Short description

← Older revision		Revision as of 11:33, 25 April 2007
Line 8:		Line 8:
	== Short description ==		== Short description ==

	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.		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.

	== Figures ==		== Figures ==

UE-InfoVis07-01: /* Short description */

2007-04-25T11:33:32Z

Short description

← Older revision		Revision as of 11:33, 25 April 2007
Line 8:		Line 8:
	== Short description ==		== Short description ==

	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.		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.

	== Figures ==		== Figures ==