Range searching
In its most general form, the range searching problem consists of preprocessing a set S of objects, in order to determine which objects from S intersect with a query object, called a range. For example, S may be a set of points corresponding to the coordinates of several cities, and we want to find the cities within a certain latitude and longitude range.
Wikipage redirect
primaryTopic
Range searching
In its most general form, the range searching problem consists of preprocessing a set S of objects, in order to determine which objects from S intersect with a query object, called a range. For example, S may be a set of points corresponding to the coordinates of several cities, and we want to find the cities within a certain latitude and longitude range.
has abstract
Dans sa forme la plus générale ...... lus de 1500 euros par mois ?".
@fr
In its most general form, the ...... d CAD), but also in databases.
@en
La búsqueda de rango consiste, ...... ino también en bases de datos.
@es
thumbnail
Link from a Wikipage to an external page
Wikipage page ID
Wikipage revision ID
711,614,955
comment
Dans sa forme la plus générale ...... de 100 km d'une ville donnée.
@fr
In its most general form, the ...... latitude and longitude range.
@en
La búsqueda de rango consiste, ...... o rango de longitud y latitud.
@es
label
Búsqueda de rango
@es
Range searching
@en
Recherche par plage
@fr
