Package org.jungrapht.visualization.spatial.rtree

Class AbstractSplitter<T>

java.lang.Object

org.jungrapht.visualization.spatial.rtree.AbstractSplitter<T>

Type Parameters:

T -

Direct Known Subclasses:

QuadraticSplitter, RStarSplitter

public abstract class AbstractSplitter<T>
extends Object

holds implementations of several ways to determine the best node to follow for insertion in the R-Tree

Author:

Tom Nelson

Constructor Summary

Constructors

Constructor	Description
AbstractSplitter()

Method Summary

Modifier and Type	Method	Description
protected Optional<Node<T>>	leastEnlargementThenAreaThenKids(InnerNode<T> nodeToSplit, Rectangle2D incoming)	least area enlargement followed by smallest area followed by fewest child nodes
protected Optional<Node<T>>	leastOverlapThenEnlargementThenAreaThenKids(InnerNode<T> nodeToSplit, Rectangle2D bounds)	least overlap then least area enlargement followed by smallest area followed by fewest kids

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

AbstractSplitter

public AbstractSplitter()

Method Detail

leastEnlargementThenAreaThenKids

protected Optional<Node<T>> leastEnlargementThenAreaThenKids(InnerNode<T> nodeToSplit,
                                                             Rectangle2D incoming)

least area enlargement followed by smallest area followed by fewest child nodes

Parameters:

nodeToSplit - the node to split

incoming - the bounds of the new element

Returns:

the node to split

leastOverlapThenEnlargementThenAreaThenKids

protected Optional<Node<T>> leastOverlapThenEnlargementThenAreaThenKids(InnerNode<T> nodeToSplit,
                                                                        Rectangle2D bounds)

least overlap then least area enlargement followed by smallest area followed by fewest kids

Parameters:

nodeToSplit - the node to split

bounds - the rectangular bounds to split

Returns:

the node that was selected to split