<?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-22T18:56:59Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/4257" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/4257</identifier><datestamp>2017-03-21T16:34:21Z</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="9669926f-dd22-4106-860a-448d805d5bf8" confidence="600">Chen, Yu</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2009-01-26T19:36:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2009-01-26T19:36:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2009-01-26T19:36:38Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2009</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/4257</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">When dealing with massive data sets, standard algorithms may&#xd;
easily ``run out of memory&amp;apos;&amp;apos;. In this thesis, we design efficient&#xd;
algorithms in space-conscious models. In particular, in-place&#xd;
algorithms, multi-pass algorithms, read-only algorithms, and&#xd;
stream-sort algorithms are studied, and the focus is on&#xd;
fundamental geometric problems, such as 2D convex hulls, 3D convex&#xd;
hulls, Voronoi diagrams and nearest neighbor queries, Klee&amp;apos;s&#xd;
measure problem, and low-dimensional linear programming.&#xd;
&#xd;
In-place algorithms only use O(1) extra space besides the input&#xd;
array. We present a data structure for 2D nearest neighbor queries&#xd;
and algorithms for Klee&amp;apos;s measure problem in this model.&#xd;
&#xd;
Algorithms in the multi-pass model only make read-only sequential&#xd;
access to the input, and use sublinear working space and small&#xd;
(usually a constant) number of passes on the input. We present&#xd;
algorithms and lower bounds for many problems, including&#xd;
low-dimensional linear programming and convex hulls, in this&#xd;
model.&#xd;
&#xd;
Algorithms in the read-only model only make read-only random&#xd;
access to the input array, and use sublinear working space. We&#xd;
present algorithms for Klee&amp;apos;s measure problem and 2D convex hulls&#xd;
in this model.&#xd;
&#xd;
Algorithms in the stream-sort model use sorting as a primitive&#xd;
operation. Each pass can either sort the data or make sequential&#xd;
access to the data. As in the multi-pass model, these algorithms&#xd;
can only use sublinear working space and a small (usually a&#xd;
constant) number of passes on the data. We present algorithms for&#xd;
constructing convex hulls and polygon triangulation in this model.</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">Algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Data Structures</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Computational Geometry</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Computer Science</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Solving Geometric Problems in Space-Conscious Models</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</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>