<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T11:10:32Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4032" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4032</identifier><datestamp>2017-03-21T16:53:49Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="097291ac-3cde-4704-86fd-f518aa51a3f1" confidence="600">Afshani, Peyman</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-09-24T20:24:48Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-24T20:24:48Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-09-24T20:24:48Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4032</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">In this thesis we deal with problems connected to range searching,&#xd;
which is one of the central areas of computational geometry. &#xd;
The dominant problems in this area are &#xd;
halfspace range searching, simplex range searching and orthogonal range searching and&#xd;
research into these problems has spanned decades.&#xd;
&#xd;
For many range searching problems, the best possible &#xd;
data structures cannot offer fast (i.e., polylogarithmic) query&#xd;
times if we limit ourselves to near linear storage.&#xd;
Even worse, it is conjectured (and proved in some cases) &#xd;
that only very small improvements to these might be possible.&#xd;
This inefficiency has encouraged many researchers to seek alternatives through approximations.&#xd;
In this thesis we continue this line of research and focus on &#xd;
relative approximation of range counting problems. &#xd;
&#xd;
One important problem where it is possible to achieve significant speedup&#xd;
through approximation is halfspace range counting in 3D.  &#xd;
Here we continue the previous research done &#xd;
and obtain the first optimal data structure for approximate halfspace range counting in 3D.&#xd;
Our data structure has the slight advantage of being Las Vegas (the result is always correct) in contrast&#xd;
to the previous methods that were Monte Carlo (the correctness holds with high probability).&#xd;
&#xd;
Another series of problems where approximation can provide us with &#xd;
substantial speedup comes from robust statistics. &#xd;
We recognize three problems here: &#xd;
approximate Tukey depth, regression depth and simplicial depth queries. &#xd;
In 2D, we obtain an optimal data structure capable of approximating&#xd;
the regression depth of a query hyperplane. &#xd;
We also offer a linear space data structure which can answer approximate &#xd;
Tukey depth queries efficiently in 3D.&#xd;
These data structures are obtained by applying our ideas for the&#xd;
approximate halfspace counting problem. &#xd;
Approximating the simplicial depth turns out to be much more &#xd;
difficult, however.&#xd;
&#xd;
Computing the simplicial depth of a given point is more computationally&#xd;
challenging than most other definitions of data depth.&#xd;
In 2D we obtain the first data structure which uses near linear space&#xd;
and can answer approximate simplicial depth queries in polylogarithmic time.&#xd;
As applications of this result, we provide two non-trivial methods to&#xd;
approximate the simplicial depth of a given point in higher dimension.&#xd;
Along the way, we establish a tight combinatorial relationship between &#xd;
the Tukey depth of any given point and its simplicial depth.&#xd;
&#xd;
Another problem investigated in this thesis is the dominance reporting problem,&#xd;
an important special case of orthogonal range reporting.&#xd;
In three dimensions, we solve this &#xd;
problem in the pointer machine model and the external memory model&#xd;
by offering the first optimal data structures in these models of computation.&#xd;
Also, in the RAM model and for points from&#xd;
an integer grid we reduce the space complexity of the fastest&#xd;
known data structure to optimal.&#xd;
Using known techniques in the literature, we can use our&#xd;
results to obtain solutions for the orthogonal range searching problem as well.&#xd;
The query complexity offered by our orthogonal range reporting data structures&#xd;
match the most efficient query complexities&#xd;
known in the literature but our space bounds are lower than the previous methods in the external &#xd;
memory model and RAM model where the input is a subset of an integer grid.&#xd;
The results also yield improved orthogonal range searching in &#xd;
higher dimensions (which shows the significance&#xd;
of the dominance reporting problem).&#xd;
&#xd;
Intersection searching is a generalization of range searching where&#xd;
we deal with more complicated geometric objects instead of points.&#xd;
We investigate the rectilinear disjoint polygon counting problem &#xd;
which is a specialized intersection counting problem. &#xd;
We provide a linear-size data structure capable of counting &#xd;
the number of disjoint rectilinear polygons &#xd;
intersecting any rectilinear polygon of constant size.&#xd;
The query time (as well as some other properties of our data structure) resembles&#xd;
the classical simplex range searching data structures.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">computational geometry</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">range searching</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">On Geometric Range Searching, Approximate Counting and Depth Problems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">I revised the following comments:&#xd;
&#xd;
1. Table of contents - add List of Figures and List of Tables titles to the Table of contents list (above the Chapter 1 Introduction title).&#xd;
&#xd;
2. Add an Appendix title to page 87.</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>