RBush
A bounding envelope, used to identify the bounds of of the points within
a particular node.
The minimum X value of the bounding box.
The minimum Y value of the bounding box.
The maximum X value of the bounding box.
The maximum Y value of the bounding box.
A bounding envelope, used to identify the bounds of of the points within
a particular node.
The minimum X value of the bounding box.
The minimum Y value of the bounding box.
The maximum X value of the bounding box.
The maximum Y value of the bounding box.
The minimum X value of the bounding box.
The minimum Y value of the bounding box.
The maximum X value of the bounding box.
The maximum Y value of the bounding box.
The calculated area of the bounding box.
Half of the linear perimeter of the bounding box
Extends a bounding box to include another bounding box
The other bounding box
A new bounding box that encloses both bounding boxes.
Does not affect the current bounding box.
Intersects a bounding box to only include the common area
of both bounding boxes
The other bounding box
A new bounding box that is the intersection of both bounding boxes.
Does not affect the current bounding box.
Determines whether is contained
within this bounding box.
The other bounding box
if is
completely contained within this bounding box;
otherwise.
Determines whether intersects
this bounding box.
The other bounding box
if is
intersects this bounding box in any way;
otherwise.
A bounding box that contains the entire 2-d plane.
An empty bounding box.
Exposes an that describes the
bounding box of current object.
The bounding box of the current object.
Provides the base interface for the abstraction for
an updateable data store of elements on a 2-d plane.
The type of elements in the index.
Adds an object to the
The object to be added to .
Removes an object from the .
The object to be removed from the .
indicating whether the item was removed.
Removes all elements from the .
Adds all of the elements from the collection to the .
A collection of items to add to the .
For multiple items, this method is more performant than
adding items individually via .
Provides the base interface for the abstraction of
an index to find points within a bounding box.
The type of elements in the index.
Get all of the elements within the current .
A list of every element contained in the .
Get all of the elements from this
within the bounding box.
The area for which to find elements.
A list of the points that are within the bounding box
from this .
An implementation of the R-tree data structure for 2-d spatial indexing.
The type of elements in the index.
The root of the R-tree.
The bounding box of all elements currently in the data structure.
Initializes a new instance of the that is
empty and has the default tree width and default .
Initializes a new instance of the that is
empty and has a custom max number of elements per tree node
and default .
Initializes a new instance of the that is
empty and has a custom max number of elements per tree node
and a custom .
Gets the number of items currently stored in the
Removes all elements from the .
Get all of the elements within the current .
A list of every element contained in the .
Get all of the elements from this
within the bounding box.
The area for which to find elements.
A list of the points that are within the bounding box
from this .
Adds an object to the
The object to be added to .
Adds all of the elements from the collection to the .
A collection of items to add to the .
For multiple items, this method is more performant than
adding items individually via .
Removes an object from the .
The object to be removed from the .
indicating whether the item was deleted.
A node in an R-tree data structure containing other nodes
or elements of type .
The descendent nodes or elements of a
The current height of a .
A node containing individual elements has a of 1.
Determines whether the current is a leaf node.
Gets the bounding box of all of the descendents of the
current .
Extension methods for the object.
Get the nearest neighbors to a specific point.
The type of elements in the index.
An index of points.
The number of points to retrieve.
The x-coordinate of the center point.
The y-coordinate of the center point.
The maximum distance of points to be considered "near"; optional.
A function to test each element for a condition; optional.
The list of up to elements nearest to the given point.
Calculates the distance from the borders of an
to a given point.
The from which to find the distance
The x-coordinate of the given point
The y-coordinate of the given point
The calculated Euclidean shortest distance from the to a given point.