Class OriginalFastVoronoiAlgorithm

java.lang.Object
com.treemap.AbstractAlgorithm
com.treemap.swing.originalfastvoronoi.OriginalFastVoronoiAlgorithm
All Implemented Interfaces:
Algorithm

public class OriginalFastVoronoiAlgorithm extends AbstractAlgorithm
  • Constructor Details

    • OriginalFastVoronoiAlgorithm

      public OriginalFastVoronoiAlgorithm()
  • Method Details

    • toString

      public String toString()
      Overrides:
      toString in class Object
    • breadthFirstLayout

      public boolean breadthFirstLayout(com.macrofocus.geom.Shape shape, MutableTreeMapNode parent, MutableTreeMapNode[] children, double sumSizes, int horizontalVanishingPoint, int verticalVanishingPoint, TreeMapWorker worker)
      Description copied from interface: Algorithm
      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(com.macrofocus.geom.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