| Modifier and Type | Interface and Description |
|---|---|
interface |
PointIndex<T> |
interface |
RectangleIndex<T> |
| Modifier and Type | Class and Description |
|---|---|
class |
PointIndexWrapper<T> |
| Modifier and Type | Class and Description |
|---|---|
class |
PointArray<T> |
class |
RectArray<T> |
| Modifier and Type | Class and Description |
|---|---|
class |
CoverTree<T>
A 'faster' CoverTree implementation based on the paper:
"Faster Cover Trees", Mike Izbicki, Christian R.
|
| Modifier and Type | Class and Description |
|---|---|
class |
KDTree<T>
A simple KD-Tree implementation.
|
| Modifier and Type | Class and Description |
|---|---|
class |
PHTreeP<T> |
class |
PHTreeR<T> |
| Modifier and Type | Class and Description |
|---|---|
class |
QuadTreeKD<T>
This is a MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
class |
QuadTreeRKD<T>
A simple MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| Modifier and Type | Class and Description |
|---|---|
class |
QuadTreeKD2<T>
This is a MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| Modifier and Type | Class and Description |
|---|---|
class |
QuadTreeKD0<T>
A simple MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
class |
QuadTreeRKD0<T>
A simple MX-quadtree implementation with configurable maximum depth, maximum nodes size, and
(if desired) automatic guessing of root rectangle.
|
| Modifier and Type | Class and Description |
|---|---|
class |
RTree<T>
R*Tree implementation based on the paper from
Beckmann, N.; Kriegel, H.
|
Copyright © 2018. All rights reserved.