Class SliceAndDiceAlgorithm

  • All Implemented Interfaces:
    Algorithm

    public class SliceAndDiceAlgorithm
    extends AbstractAlgorithm
    Implementation of the Slice-and-dice algorithm described in the original treemap paper. It is described in:

    Ben Shneiderman. 'Tree Visualization with Tree-Maps: 2-d Space-filling Approach." ACM Transactions on Graphics, 11(1), pp. 92-99, 1992.

    It uses parallel lines to divide a rectangle representing an item into smaller rectangles representing its children. At each level of hierarchy the orientation of the lines - vertical or horizontal - is switched (Alternate), computed according to the aspect ratio (Best), or fixed (Vertical, Horizontal).

    Complexity: O(n), where n is the number of nodes in the tree.

    • Constructor Detail

      • SliceAndDiceAlgorithm

        public SliceAndDiceAlgorithm()
        Creates an instance of the slice-and-dice algorithm with the orientation of the layout switched between vertical and horizontal at each hierarchy level.
      • SliceAndDiceAlgorithm

        public SliceAndDiceAlgorithm​(SliceAndDiceAlgorithm.OrientationStragegy orientationStrategy)
        Creates an instance of the slide-and-dice algorithm with the given orientation strategy.
        Parameters:
        orientationStrategy - the orientation strategy to use
    • Method Detail

      • breadthFirstLayout

        public boolean breadthFirstLayout​(java.awt.Shape shape,
                                          MutableTreeMapNode parent,
                                          MutableTreeMapNode[] children,
                                          double sumSizes,
                                          int horizontalVanishingPoint,
                                          int verticalVanishingPoint,
                                          TreeMapWorker worker)
        Arrange the items in the given array to fill the given shape. This is called during the first pass, while traversing the tree top down.
        Parameters:
        shape - the current rectangle being divided.
        parent - the parent node.
        children - the items to map.
        sumSizes - the size of the parent.
        worker - the worker thread
        Returns:
        true if the layout has been cancelled, false otherwise
      • isCompatible

        public boolean isCompatible​(java.awt.Shape shape)
        Description copied from interface: Algorithm
        Indicates whether the layout algorithm can handle the given geometry of its parent
        Parameters:
        shape - the geometry of its parent
        Returns:
        true if it can lay out the children using the specified geometrical shape
      • toString

        public java.lang.String toString()
        Overrides:
        toString in class java.lang.Object