Searching by panning and zooming
We consider the problem of searching through visualizations of large amounts of data by performing panning and zooming operations. We give algorithms to travel from a source to an unknown target using a number of pans and zooms that is competitive with the optimal number of pans and zooms depending on certain parameters, and consider both the one-dimensional and two-dimensional versions of this problem.
|Conference||26th Canadian Conference on Computational Geometry, CCCG 2014|
Bose, P, Howat, J. (John), & Morin, P. (2014). Searching by panning and zooming. Presented at the 26th Canadian Conference on Computational Geometry, CCCG 2014.