Package | Description |
---|---|
org.locationtech.jts.index.strtree |
Contains 2-D and 1-D versions of the Sort-Tile-Recursive (STR) tree, a query-only R-tree.
|
org.locationtech.jts.operation.distance |
Provides classes for computing the distance between geometries
|
org.locationtech.jts.precision |
Provides classes for analyzing and
manipulating the precision of Geometries.
|
Modifier and Type | Class and Description |
---|---|
class |
GeometryItemDistance
An ItemDistance function for
items which are
Geometry s,
using the Geometry.distance(Geometry) method. |
Modifier and Type | Field and Description |
---|---|
private ItemDistance |
BoundablePair.itemDistance |
Modifier and Type | Method and Description |
---|---|
java.lang.Object |
STRtree.nearestNeighbour(Envelope env,
java.lang.Object item,
ItemDistance itemDist)
Finds the item in this tree which is nearest to the given
Object ,
using ItemDistance as the distance metric. |
java.lang.Object[] |
STRtree.nearestNeighbour(Envelope env,
java.lang.Object item,
ItemDistance itemDist,
int k)
Finds k items in this tree which are the top k nearest neighbors to the given
item ,
using itemDist as the distance metric. |
java.lang.Object[] |
STRtree.nearestNeighbour(ItemDistance itemDist)
Finds the two nearest items in the tree,
using
ItemDistance as the distance metric. |
java.lang.Object[] |
STRtree.nearestNeighbour(STRtree tree,
ItemDistance itemDist)
Finds the two nearest items from this tree
and another tree,
using
ItemDistance as the distance metric. |
Constructor and Description |
---|
BoundablePair(Boundable boundable1,
Boundable boundable2,
ItemDistance itemDistance) |
Modifier and Type | Class and Description |
---|---|
private static class |
IndexedFacetDistance.FacetSequenceDistance
Tests whether the base geometry lies within
a specified distance of the given geometry.
|
Modifier and Type | Class and Description |
---|---|
private static class |
MinimumClearance.MinClearanceDistance
Implements the MinimumClearance distance function:
dist(p1, p2) =
p1 != p2 : p1.distance(p2)
p1 == p2 : Double.MAX
dist(p, seg) =
p != seq.p1 && p != seg.p2 : seg.distance(p)
ELSE : Double.MAX
Also computes the values of the nearest points, if any.
|