Three Methods for Range Queries in Computational Geometry
Name
MIT-LCS-TM-388.pdf
Size
6.62 MB
Format
Adobe PDF
Checksum (MD5)
d30efc4b13d3bf1da544a818d6a45c11
Author(s)
Kipnis, Shlomo
Date Issued
March 1989
Series/Report no.
MIT-LCS-TM-388
Abstract
This paper surveys a variety of recent results addressing the problem of range queries in computational geometry. The major contribution of this paper is in identifying three general methods for range queries in computational geometry and in classifying many of the recent results into one or more of these approaches. The three methods discussed in this paper are random sampling, search-tree tables, and space-partition trees. This survey assumes some familiarity with basic computational geometry concepts and techniques.
Persistent DSpace Link
