NEAREST SEARCH ON ADAPTIVE INDEX WITH VARIABLE COMPRESSION

摘要

A search system can search nodes of a tree to find the object stored in the tree that is nearest to a position input by the user (Figure 3). The tree can be constructed using object keys with interlaced coordinates such that nodes in the tree correspond to a bounding box that bounds a subset of objects (Figure 3). The search algorithm can find the nearest object to a position (Figure 3).