Nearest neighbor detection method for moving object
A technology of moving objects and neighbors, applied in measurement devices, radio wave measurement systems, services based on location information, etc., can solve problems such as bottlenecks
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment Construction
[0053] specific implementation
[0054] figure 1 is a schematic diagram of a TPR-tree structure, where ( u 1 , u 2 ,… u 10 ) 10 mobile users are recursively divided into four groups according to the similarity of spatial location, N1, N2, N3, N4, N1 and N2 are further reduced to N5, N3 and N4 are further reduced to N6, and N5 and N6 constitute the root node. Because the basic process of the TPR-tree insertion and deletion algorithm is as follows:
[0055] The data item of the node (leaf node and non-leaf node) shall contain the identification of the moving object and the minimum rectangle surrounding the root node of its subtree. The rectangle containing the moving object is called the data rectangle; the index space corresponding to the non-leaf node index items is called the directory rectangle. Both types of rectangles are allowed to overlap,
[0056] Find: Find whether a moving object exists in the index range.
[0057] For lookup, the TPR-tree needs to look up...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 