Now showing items 1-3 of 3

    • Adaptive Range Counting and Other Frequency-Based Range Query Problems 

      Wilkinson, Bryan T. (University of Waterloo, 2012-05-18)
      We consider variations of range searching in which, given a query range, our goal is to compute some function based on frequencies of points that lie in the range. The most basic such computation involves counting the ...
    • Area-Efficient Drawings of Outer-1-Planar Graphs 

      Bulatovic, Pavle (University of Waterloo, 2020-09-29)
      We study area-efficient drawings of planar graphs: embeddings of graphs on an integer grid so that the bounding box of the drawing is minimized. Our focus is on the class of outer-1-planar graphs: the family of planar ...
    • Folding Orthogonal Polyhedra 

      Sun, Julie (University of Waterloo, 1999)
      In this thesis, we study foldings of orthogonal polygons into orthogonal polyhedra. The particular problem examined here is whether a paper cutout of an orthogonal polygon with fold lines indicated folds up into a simple ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages