| Package | Description |
|---|---|
| com.github.davidmoten.rtree2 | |
| com.github.davidmoten.rtree2.geometry | |
| com.github.davidmoten.rtree2.geometry.internal |
| Modifier and Type | Method and Description |
|---|---|
Iterable<Entry<T,S>> |
RTree.nearest(Point p,
double maxDistance,
int maxCount)
Returns the nearest k entries (k=maxCount) to the given point where the
entries are strictly less than a given maximum distance from the point.
|
Iterable<Entry<T,S>> |
RTree.search(Point p)
|
Iterable<Entry<T,S>> |
RTree.search(Point p,
double maxDistance)
|
| Modifier and Type | Field and Description |
|---|---|
static BiPredicate<Circle,Point> |
Intersects.circleIntersectsPoint |
static BiPredicate<Geometry,Point> |
Intersects.geometryIntersectsPoint |
static BiPredicate<Line,Point> |
Intersects.lineIntersectsPoint |
static BiPredicate<Point,Circle> |
Intersects.pointIntersectsCircle |
static BiPredicate<Point,Geometry> |
Intersects.pointIntersectsGeometry |
static BiPredicate<Point,Line> |
Intersects.pointIntersectsLine |
| Modifier and Type | Method and Description |
|---|---|
static Point |
Geometries.point(double x,
double y) |
static Point |
Geometries.point(float x,
float y) |
static Point |
Geometries.pointGeographic(double lon,
double lat) |
static Point |
Geometries.pointGeographic(float lon,
float lat) |
| Modifier and Type | Method and Description |
|---|---|
boolean |
Circle.intersects(Point point) |
boolean |
Line.intersects(Point point) |
| Modifier and Type | Class and Description |
|---|---|
class |
PointDouble |
class |
PointFloat |
| Modifier and Type | Method and Description |
|---|---|
boolean |
CircleDouble.intersects(Point point) |
boolean |
CircleFloat.intersects(Point point) |
boolean |
LineDouble.intersects(Point point) |
boolean |
LineFloat.intersects(Point point) |
Copyright © 2013–2022. All rights reserved.