Tradeoffs in Approximate Range Searching Made Simpler

  title={Tradeoffs in Approximate Range Searching Made Simpler},
  author={Sunil Arya and Guilherme Dias da Fonseca and David M. Mount},
  journal={2008 XXI Brazilian Symposium on Computer Graphics and Image Processing},
Range searching is a fundamental problem in computational geometry. The problem involves preprocessing a set of n points in R^d into a data structure, so that it is possible to determine the subset of points lying within a given query range. In approximate range searching, a parameter eps epsiv > 0 is given, and for a given query range R the points lying within distance eps diam(R) of the range's boundary may be counted or not. In this paper we present three results related to the issue of… CONTINUE READING


Publications citing this paper.

Similar Papers

Loading similar papers…