| Package | Description |
|---|---|
| com.github.davidmoten.rtree | |
| com.github.davidmoten.rtree.geometry |
| Modifier and Type | Class and Description |
|---|---|
class |
Entry<T,S extends Geometry>
An entry in the R-tree which has a spatial representation.
|
class |
RTree<T,S extends Geometry>
Immutable in-memory 2D R-Tree with configurable splitter heuristic.
|
| Modifier and Type | Method and Description |
|---|---|
static <T,S extends Geometry> |
Comparators.ascendingDistance(Rectangle r)
Returns a comparator that can be used to sort entries returned by search
methods.
|
static <T,S extends Geometry> |
RTree.create()
Returns a new Builder instance for
RTree. |
<T,S extends Geometry> |
RTree.Builder.create()
Builds the
RTree. |
static <T,S extends Geometry> |
Entry.entry(T value,
S geometry)
Factory method.
|
<R extends Geometry> |
RTree.search(R g,
double maxDistance,
rx.functions.Func2<? super S,? super R,Double> distance)
Returns all entries strictly less than
maxDistance from the
given geometry. |
<R extends Geometry> |
RTree.search(R g,
rx.functions.Func2<? super S,? super R,Boolean> intersects)
Returns the intersections with the the given (arbitrary) geometry using
an intersection function to filter the search results returned from a
search of the mbr of
g. |
<T,S extends Geometry> |
SelectorMinimalAreaIncrease.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes) |
<T,S extends Geometry> |
Selector.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes)
Returns the node from a list of nodes that an object with the given
geometry would be added to.
|
<T,S extends Geometry> |
SelectorRStar.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes) |
<T,S extends Geometry> |
SelectorMinimalOverlapArea.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes) |
| Modifier and Type | Method and Description |
|---|---|
static rx.functions.Func1<Geometry,Boolean> |
RTree.intersects(Rectangle r)
Returns a predicate function that indicates if
Geometry
intersects with a given rectangle. |
| Modifier and Type | Method and Description |
|---|---|
<T,S extends Geometry> |
SelectorMinimalAreaIncrease.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes) |
<T,S extends Geometry> |
Selector.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes)
Returns the node from a list of nodes that an object with the given
geometry would be added to.
|
<T,S extends Geometry> |
SelectorRStar.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes) |
<T,S extends Geometry> |
SelectorMinimalOverlapArea.select(Geometry g,
List<? extends com.github.davidmoten.rtree.Node<T,S>> nodes) |
| Modifier and Type | Class and Description |
|---|---|
class |
Circle |
class |
Point |
class |
Rectangle |
| Modifier and Type | Method and Description |
|---|---|
Geometry |
Rectangle.geometry() |
Geometry |
Group.geometry() |
Geometry |
HasGeometry.geometry() |
Copyright © 2013–2015. All rights reserved.