Nearest search on adaptive index with variable compression

Details Nearest search on adaptive index with variable compression Nearest search on adaptive index with variable compression

G - Physics

06

F

G06F 17/30 (2006.01) G09B 29/00 (2006.01)

Patent

CA 2654858

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).

L'invention concerne un système de recherche pouvant consulter les noeuds d'un arbre à la recherche de l'objet stocké dans l'arbre le plus proche d'une position entrée par l'utilisateur. L'arbre peut être construit à l'aide de clés d'objets avec des coordonnées entrelacées de manière que les noeuds de l'arbre correspondent à un cadre d'objet englobant un sous-ensemble d'objets. L'algorithme de recherche peut trouver l'objet le plus proche d'une position.

Affiliated with

Also associated with

Rating

Nearest search on adaptive index with variable compression does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Nearest search on adaptive index with variable compression, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nearest search on adaptive index with variable compression will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFCA-PAI-O-1463401