Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network

  Advanced Search  

Approximate Range Searching Department of Computer Science

Summary: Approximate Range Searching
Sunil Arya
Department of Computer Science
The Hong Kong University of Science and Technology
Clear Water Bay, Kowloon, Hong Kong
David M. Mount
Department of Computer Science and
Institute for Advanced Computer Studies
University of Maryland
College Park, MD 20742
The range searching problem is a fundamental problem in compu-
tational geometry, with numerous important applications. Most re-
search has focused on solving this problem exactly, but lower bounds
show that if linear space is assumed, the problem cannot be solved in
polylogarithmic time, except for the case of orthogonal ranges. In this
paper we show that if one is willing to allow approximate ranges, then
it is possible to do much better. In particular, given a bounded range
Q of diameter w and > 0, an approximate range query treats the
range as a fuzzy object, meaning that points lying within distance w


Source: Arya, Sunil - Department of Computer Science, Hong Kong University of Science and Technology


Collections: Computer Technologies and Information Sciences