<?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-22T22:07:59Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/19182" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/19182</identifier><datestamp>2025-03-26T23:34:10Z</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="advisor">Lubiw, Anna</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="effb6d90-9c67-4274-99d8-84571bcb3d78" confidence="600">Naredla, Anurag Murty</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2023-02-24T13:51:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2023-02-24T13:51:42Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2023-02-24</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2023-01-26</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/19182</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">We study three geometric facility location problems in this thesis.&#xd;
First, we consider the dispersion problem in one dimension. We are given an ordered list&#xd;
of (possibly overlapping) intervals on a line. We wish to choose exactly one point from&#xd;
each interval such that their left to right ordering on the line matches the input order.&#xd;
The aim is to choose the points so that the distance between the closest pair of points is&#xd;
maximized, i.e., they must be socially distanced while respecting the order. We give a new&#xd;
linear-time algorithm for this problem that produces a lexicographically optimal solution.&#xd;
We also consider some generalizations of this problem.&#xd;
For the next two problems, the domain of interest is a simple polygon with n vertices.&#xd;
The second problem concerns the visibility center. The convention is to think of a polygon&#xd;
as the top view of a building (or art gallery) where the polygon boundary represents opaque&#xd;
walls. Two points in the domain are visible to each other if the line segment joining them&#xd;
does not intersect the polygon exterior. The distance to visibility from a source point to a&#xd;
target point is the minimum geodesic distance from the source to a point in the polygon&#xd;
visible to the target. The question is: Where should a single guard be located within the&#xd;
polygon to minimize the maximum distance to visibility? For m point sites in the polygon,&#xd;
we give an O((m + n) log (m + n)) time algorithm to determine their visibility center.&#xd;
Finally, we address the problem of locating the geodesic edge center of a simple polygon—a&#xd;
point in the polygon that minimizes the maximum geodesic distance to any edge. For a&#xd;
triangle, this point coincides with its incenter. The geodesic edge center is a generalization&#xd;
of the well-studied geodesic center (a point that minimizes the maximum distance to any&#xd;
vertex). Center problems are closely related to farthest Voronoi diagrams, which are well-&#xd;
studied for point sites in the plane, and less well-studied for line segment sites in the plane.&#xd;
When the domain is a polygon rather than the whole plane, only the case of point sites has&#xd;
been addressed—surprisingly, more general sites (with line segments being the simplest&#xd;
example) have been largely ignored. En route to our solution, we revisit, correct, and&#xd;
generalize (sometimes in a non-trivial manner) existing algorithms and structures tailored&#xd;
to work specifically for point sites. We give an optimal linear-time algorithm for finding&#xd;
the geodesic edge center of a simple polygon.</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">visibility algorithms</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">computational geometry</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">geodesic centers</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">facility location</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Algorithms for Geometric Facility Location: Centers in a Polygon and Dispersion on a Line</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Lubiw, Anna</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</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>