Efficient creation of ON_RTree ("bulk insert")

[menno (Menno Deij - van Rijswijk)]

Ok, thanks for your clear explanation. I am indeed using the R-tree for multiple fast searches, as described in

Minimum distance between two surfaces that do not overlap

I finally made it to a robust algorithm for this problem. After checking that the surfaces do not intersect, in the first step I create coarse meshes on the surfaces and use an RTree-based branch-and-bound algorithm to find the closest pair of mesh vertices. These two points are then the seeds for the iterative approach ClosestPoint described earlier. By the way, the algorithm to find the closest pair of points on meshes (or any point collection) performs the pants off of ON_GetMeshMeshClosestP…