Algorithms for Geometric Facility Location: Centers in a Polygon and Dispersion on a Line
AM Naredla - 2023 - uwspace.uwaterloo.ca
We study three geometric facility location problems in this thesis. First, we consider the
dispersion problem in one dimension. We are given an ordered list of (possibly overlap**) …
dispersion problem in one dimension. We are given an ordered list of (possibly overlap**) …
Kernelization for Spreading Points
We consider the following problem about dispersing points. Given a set of points in the
plane, the task is to identify whether by moving a small number of points by small distance …
plane, the task is to identify whether by moving a small number of points by small distance …
Algorithms for Optimally Shifting Intervals under Intersection Graph Models
We propose a new model for graph editing problems on intersection graphs. In well-studied
graph editing problems, adding and deleting vertices and edges are used as graph editing …
graph editing problems, adding and deleting vertices and edges are used as graph editing …
Computing realistic terrains from imprecise elevations
GR Stroud - 2022 - uwspace.uwaterloo.ca
It is ideal for triangulated terrains to have characteristics or properties that are realistic. In the
imprecise terrain model, each vertex of a triangulated terrain has an imprecise eleva-tion …
imprecise terrain model, each vertex of a triangulated terrain has an imprecise eleva-tion …
Algorithms for Optimally Shifting Intervals Under Intersection Graph Models
We propose a new model for graph editing problems on intersection graphs. In well-studied
graph editing problems, adding and deleting vertices and edges are used as graph editing …
graph editing problems, adding and deleting vertices and edges are used as graph editing …