Class LeastEnlargementInsertionStrategy

  • All Implemented Interfaces:
    InsertionStrategy

    @Reference(authors="A. Guttman",
               title="R-Trees: A Dynamic Index Structure For Spatial Searching",
               booktitle="Proc. 1984 ACM SIGMOD Int. Conf. on Management of Data",
               url="https://doi.org/10.1145/971697.602266",
               bibkey="doi:10.1145/971697.602266")
    public class LeastEnlargementInsertionStrategy
    extends java.lang.Object
    implements InsertionStrategy
    The default R-Tree insertion strategy: find rectangle with least volume enlargement.

    Reference:

    A. Guttman
    R-Trees: A Dynamic Index Structure For Spatial Searching
    Proc. 1984 ACM SIGMOD Int. Conf. Management of Data

    Since:
    0.5.0
    Author:
    Erich Schubert
    • Constructor Detail

      • LeastEnlargementInsertionStrategy

        public LeastEnlargementInsertionStrategy()
        Constructor.
    • Method Detail

      • choose

        public <A> int choose​(A options,
                              ArrayAdapter<? extends SpatialComparable,​A> getter,
                              SpatialComparable obj,
                              int height,
                              int depth)
        Description copied from interface: InsertionStrategy
        Choose insertion rectangle.
        Specified by:
        choose in interface InsertionStrategy
        Parameters:
        options - Options to choose from
        getter - Array adapter for options
        obj - Insertion object
        height - Tree height
        depth - Insertion depth (depth == height - 1 indicates leaf level)
        Returns:
        Subtree index in array.