Accession Number : ADA318684
Title : Range Searching.
Descriptive Note : Technical rept.,
Corporate Author : DUKE UNIV DURHAM NC DEPT OF COMPUTER SCIENCE
Personal Author(s) : Agarwal, Pankaj K.
PDF Url : ADA318684
Report Date : 08 SEP 1996
Pagination or Media Count : 32
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.
Descriptors : *MATHEMATICAL MODELS, ALGORITHMS, DATA MANAGEMENT, LINEAR PROGRAMMING, INPUT OUTPUT PROCESSING, ALGEBRAIC TOPOLOGY, RANGE FINDING, ORTHOGONALITY, PLANE GEOMETRY.
Subject Categories : Operations Research
Distribution Statement : APPROVED FOR PUBLIC RELEASE