RTree

RTree class

Represents a spatial search structure based on implementations of the R-tree algorithm by Toni Gutman.

The opennurbs rtree code is a modified version of the free and unrestricted R-tree implementation obtained from http://www.superliminal.com/sources/sources.htm .

Derived Classes:

Namespace: Rhino.Geometry
RTree: references

Constructors (1)

RTree()

Initializes a new, empty instance of the tree.

Properties (1)

Count

Gets the number of items in this tree.

Methods (26)

Clear()

Removes all elements.

CreateFromPointArray(IEnumerable<Point3d> points)

Constructs a new tree with an element for each point cloud point.

CreateMeshFaceTree(Mesh mesh)

Constructs a new tree with an element for each face in the mesh. The element id is set to the index of the face.

CreatePointCloudTree(PointCloud cloud)

Constructs a new tree with an element for each point cloud point.

Dispose()

Actively reclaims unmanaged resources that this instance uses.

Dispose(bool disposing)

For derived class implementers.
This method is called with argument True when class user calls Dispose(), while with argument False when the Garbage Collector invokes the finalizer, or Finalize() method.
You must reclaim all used unmanaged resources in both cases, and can use this chance to call Dispose on disposable fields if the argument is true.
Also, you must call the base virtual method within your overriding method.

Insert(BoundingBox box, int elementId)

Inserts an element into the tree.

Insert(BoundingBox box,IntPtr elementId)

Inserts an element into the tree.

Insert(Point2d point, int elementId)

Inserts an element into the tree.

Insert(Point2d point,IntPtr elementId)

Inserts an element into the tree.

Insert(Point3d point, int elementId)

Inserts an element into the tree.

Insert(Point3d point,IntPtr elementId)

Inserts an element into the tree.

Point3dClosestPoints(IEnumerable<Point3d> hayPoints, IEnumerable<Point3d> needlePts, double limitDistance)

Finds the point in a list of 3D points that is closest to a test point.

Point3dKNeighbors(IEnumerable<Point3d> hayPoints, IEnumerable<Point3d> needlePts, int amount)

Finds a certain amount of points in a list of 3D points that are the k-closest to a test point.

PointCloudClosestPoints(PointCloud pointcloud, IEnumerable<Point3d> needlePts, double limitDistance)

Finds the point in a list of 3D points that is closest to a test point.

PointCloudKNeighbors(PointCloud pointcloud, IEnumerable<Point3d> needlePts, int amount)

Finds a certain amount of points in a list of 3D points that are the k-closest to a test point.

Remove(BoundingBox box, int elementId)

Removes an element from the tree.

Remove(BoundingBox box,IntPtr elementId)

Removes an element from the tree.

Remove(Point2d point, int elementId)

Removes an element from the tree.

Remove(Point3d point, int elementId)

Removes an element from the tree.

Remove(Point3d point,IntPtr elementId)

Removes an element from the tree.

Search(BoundingBox box, EventHandler<RTreeEventArgs> callback, object tag)

Searches for items in a bounding box.
The bounding box can be singular and contain exactly one single point.

Search(BoundingBox box, EventHandler<RTreeEventArgs> callback)

Searches for items in a bounding box.
The bounding box can be singular and contain exactly one single point.

Search(Sphere sphere, EventHandler<RTreeEventArgs> callback, object tag)

Searches for items in a sphere.

Search(Sphere sphere, EventHandler<RTreeEventArgs> callback)

Searches for items in a sphere.

SearchOverlaps(RTree treeA, RTree treeB, double tolerance, EventHandler<RTreeEventArgs> callback)

Searches two R-trees for all pairs elements whose bounding boxes overlap.

Nothing found