Now showing items 1-1 of 1
On Geometric Range Searching, Approximate Counting and Depth Problems
(University of Waterloo, 2008-09-24)
In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching ...