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 a query object, called a range, intersects. 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. The range searching problems and data structures are a fundamental topic of computational geometry.

PropertyValue
dbpedia-owl:thumbnail
dbpprop:abstract
  • 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 a query object, called a range, intersects. 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. The range searching problems and data structures are a fundamental topic of computational geometry. The range searching problem finds applications not only in areas that deal with processing geometrical data, but also in databases.
dbpprop:hasPhotoCollection
rdf:type
rdfs:comment
  • 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 a query object, called a range, intersects. 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. The range searching problems and data structures are a fundamental topic of computational geometry.
rdfs:label
  • Range searching
owl:sameAs
skos:subject
foaf:depiction
foaf:page
is dbpprop:redirect of
is owl:sameAs of