Three Methods for Range Queries in Computational Geometry
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.
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1989
- Accession Number
- ADA210830
Entities
People
- Shlomo Kipnis
Organizations
- Massachusetts Institute of Technology