Package org.jungrapht.visualization.spatial.rtree

Visualization mechanisms for supporting RTree spatial data structures.

Interface Summary

Interface	Description
Bounded	Interface for items that present a bounding box rectangle
BoundedList<B extends Bounded>	interface for a list of Bounded items.
BoundedMap<T>
LeafSplitter<T>	Interface for splitting LeafVertices containing Map.Entries as children
Node<T>	Interface for R-Tree nodes Includes static functions for area, union, margin, overlap
Splitter<T>	interface for classes that hold semantics for R-Tree and R*-Tree
TreeNode

Class Summary

Class	Description
AbstractSplitter<T>	holds implementations of several ways to determine the best node to follow for insertion in the R-Tree
HorizontalCenterNodeComparator<T>	A comparator to compare along the x-axis, Vertices where the values are Rectangle2D are compared with the center x values
HorizontalEdgeMapEntryComparator<T>	A comparator to compare along the x-axis, Map.Entries where the values are Rectangle2D First compare the min x values, then the max x values
HorizontalEdgeNodeComparator<T>	A comparator to compare along the x-axis, Vertices where the values are Rectangle2D First compare the min x values, then the max x values
InnerNode<T>	a non-leaf node of the R-Tree.
LeafNode<T>	a leaf node of an R-Tree.
NodeList<B extends Bounded>	A list of elements that are Bounded by a Rectangle2D The list is also Bounded by the combined union of its elements
NodeMap<V>	A Map of elements to Rectangle2D where the union of the child elements is kept up to date with the values in the Map
Pair<T>	A collection of two items.
QuadraticLeafSplitter<T>	splits the passed entries using the quadratic method (for R-Tree)
QuadraticSplitter<T>
RStarLeafSplitter<T>	splits a Collection of Map.Entries according to R*-Tree semantics
RStarSplitter<T>
RTree<T>	R-Tree or R*-Tree implementation, depending on the type of Splitters passed in the SplitterContext
RTreeNode<T>	contains the parent for Node implementations
SplitterContext<T>	a container for the functions that support R-Tree and R*-Tree
VerticalEdgeMapEntryComparator<T>	A comparator to compare along the y-axis, Map.Entries where the values are Rectangle2D First compare the min y values, then the max y values
VerticalEdgeNodeComparator<T>	A comparator to compare along the y-axis, Vertices where the values are Rectangle2D First compare the min y values, then the max y values