sentences:  The cover tree has a theoretical bound that is based on the dataset's doubling constant.The bound on search time is "O"("c"12 log "n") where "c" is the expansion constant of the dataset.In the special case where the data is a dense 3D map of geometric points, the projection geometry of the sensing technique can be used to dramatically simplify the search problem.