On Geometric Range Searching, Approximate Counting and Depth Problems
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 and orthogonal range searching and research into these problems has spanned deca...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/4032 |