Range Searching.

Abstract

Range searching is one of the central problems in computational geometry, because it arises in many applications and a wide variety of geometric problems can be formulated as a range-searching problem. Range counting and range reporting are just two instances of range-searching queries. Typically, the canonical subsets are organized in a tree-like data structure, each of whose node V is associated with a canonical subset A; V stores the weight w(A) and some auxiliary information. A query is answered by searching the tree in a top-down fashion, using the auxiliary information to guide the search.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 08, 1996
Accession Number
ADA318684

Entities

People

  • Pankaj Agarwal

Organizations

  • Duke University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Computations
  • Computer Science
  • Computers
  • Databases
  • Geometry
  • Linear Programming
  • Numbers
  • Optimization
  • Polygons
  • Polynomials
  • Quadrants
  • Ray Tracing
  • Trees (Data Structures)
  • Two Dimensional

Fields of Study

  • Computer science

Readers

  • Computational Linguistics
  • Mathematical Modeling and Probability Theory.
  • Sensor Fusion and Tracking Systems.