ABSTRACT
In order to accelerate the search of samples for which the point ~p is within radial range, the cached data may be stored in one of a variety of indexing structures. In the case of an 356 octree, each sample can be stored in the single node containing ~ps at the lowest level of 378 the tree whose size encompasses the sample’s diameter, such that traversal explores the atmost 8 nodes whose doubled size encompasses the query point ~p. Alternatively, each sample might be stored in all of the at-most 8 same-level nodes whose spatial extent overlaps its sphere of influence, such that traversal readily proceeds down the branch containing ~p while considering all stored samples whose radial extent overlaps ~p.
