Squarified Plus Algorithm
Implementation of the Squarified+ algorithm. It is described in:
Cesarano A, Ferrucci F, Torre M. A heuristic extending the Squarified treemapping algorithm. arXiv preprint arXiv:1609.00754. 2016 Sep 2.
A heuristic extending the squarified algorithm with better aspect ratios and higher homogeneity among items.
Complexity: O(n), where n is the number of nodes in the tree.
Properties
Functions
Link copied to clipboard
open override fun <N, Row, Column> breadthFirstLayout(shape: Shape, parent: N, children: Array<N>, sumSize: Double, horizontalVanishingPoint: Int, verticalVanishingPoint: Int, accessor: TreeMapAccessor<N>, worker: TreeMapWorker?): Boolean
{@inheritDoc}
Link copied to clipboard
open override fun <N, Row, Column> depthFirstLayout(shape: Shape?, parent: N, children: Array<N>, sumSizes: Double, horizontalVanishingPoint: Int, verticalVanishingPoint: Int, accessor: TreeMapAccessor<N>, worker: TreeMapWorker?): Boolean
Arrange the items in the given array to fill the given shape. This is called during the first pass, while traversing the tree from the bottom up.
Link copied to clipboard
open override fun <N, Row, Column> finishLayout(bounds: Rectangle2D?, model: TreeMapModel<N, Row, Column>?, root: N)
Do nothing by default.
Link copied to clipboard
Indicates whether the layout algorithm can handle the given geometry of its parent
Link copied to clipboard
open override fun <N, Row, Column> startLayout(bounds: Rectangle2D?, model: TreeMapModel<N, Row, Column>, root: N, worker: TreeMapWorker?)
Do nothing by default.