Show simple item record

dc.contributor.authorKipnis, Shlomoen_US
dc.date.accessioned2023-03-29T14:32:32Z
dc.date.available2023-03-29T14:32:32Z
dc.date.issued1989-03
dc.identifier.urihttps://hdl.handle.net/1721.1/149146
dc.description.abstractThis 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.en_US
dc.relation.ispartofseriesMIT-LCS-TM-388
dc.titleThree Methods for Range Queries in Computational Geometryen_US
dc.identifier.oclc20135992


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record