Summary: Tradeoffs in Approximate Range Searching Made Simpler
Sunil Arya
Department of Computer Science
The Hong Kong University of
Science and Technology
Clear Water Bay, Kowloon, Hong Kong
arya@cs.ust.hk
Guilherme D. da Fonseca
Department of Computer Science
University of Maryland
College Park, Maryland 20742
fonseca@cs.umd.edu
David M. Mount
Department of Computer Science and
Institute for Advanced Computer Studies
University of Maryland
College Park, Maryland 20742
mount@cs.umd.edu
Abstract
Range searching is a fundamental problem in compu-

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

Collections: Computer Technologies and Information Sciences