Package | Description |
---|---|
org.locationtech.jts.index.kdtree |
Contains classes which implement a k-D tree index over 2-D point data.
|
Modifier and Type | Field and Description |
---|---|
private KdNode |
KdNode.left |
private KdNode |
KdTree.BestMatchVisitor.matchNode |
private KdNode |
KdNode.right |
private KdNode |
KdTree.root |
Modifier and Type | Method and Description |
---|---|
private KdNode |
KdTree.findBestMatchNode(Coordinate p)
Finds the node in the tree which is the best match for a point
being inserted.
|
KdNode |
KdNode.getLeft()
Returns the left node of the tree
|
KdNode |
KdTree.BestMatchVisitor.getNode() |
KdNode |
KdNode.getRight()
Returns the right node of the tree
|
KdNode |
KdTree.insert(Coordinate p)
Inserts a new point in the kd-tree, with no data.
|
KdNode |
KdTree.insert(Coordinate p,
java.lang.Object data)
Inserts a new point into the kd-tree.
|
private KdNode |
KdTree.insertExact(Coordinate p,
java.lang.Object data)
Inserts a point known to be beyond the distance tolerance of any existing node.
|
Modifier and Type | Method and Description |
---|---|
private void |
KdTree.queryNode(KdNode currentNode,
Envelope queryEnv,
boolean odd,
KdNodeVisitor visitor) |
(package private) void |
KdNode.setLeft(KdNode _left) |
(package private) void |
KdNode.setRight(KdNode _right) |
void |
KdTree.BestMatchVisitor.visit(KdNode node) |
void |
KdNodeVisitor.visit(KdNode node)
Visits a node.
|