edu.tum.cs.commons.treemap
Class StripeTreeMapAlgorithm
java.lang.Object
edu.tum.cs.commons.treemap.StripeTreeMapAlgorithm
- All Implemented Interfaces:
- ITreeMapLayoutAlgorithm
public class StripeTreeMapAlgorithm
- extends java.lang.Object
- implements ITreeMapLayoutAlgorithm
The strip layout algorithm adapted from Bederson, Shneiderman, Wattenberg:
"Ordered and Quantum Treemaps".
This is useful as it tries to minimize the aspect ratio of the generated
squares while maintaining the original order.
- Version:
- $Rev: 26931 $
- Author:
- Benjamin Hummel, $Author: besenreu $
- Rating:
- GREEN Hash: 1B6839F786A1CE254964E4259A7B321C
Method Summary |
|
layout(ITreeMapNode<T> tree,
java.awt.geom.Rectangle2D target)
Modifies the given tree by adding layout information. |
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
StripeTreeMapAlgorithm
public StripeTreeMapAlgorithm()
layout
public <T> void layout(ITreeMapNode<T> tree,
java.awt.geom.Rectangle2D target)
- Modifies the given tree by adding layout information. The topmost
rectangle will be the given target rectangle. All other nodes will be
assigned rectangles which sum exactly to the the rectangle of they target
node and have areas proportional to their size.
- Specified by:
layout
in interface ITreeMapLayoutAlgorithm
TUM CCSM Commons - 2.7