Year: 2013
Type: article
Abstract: In this paper, we present a novel visualization technique for assisting the observation and analysis of algorithmic complexity. In comparison with conventional line graphs, this new technique is not sensitive to the units of measurement, allowing multivariate data series of different physical qualities (e.g., time, space and energy) to be juxtaposed together conveniently and consistently. It supports multivariate visualization as well as uncertainty visualization. It enables users to focus on algorithm categorization by complexity classes, while reducing visual impact caused by constants and algorithmic components that are insignificant to complexity analysis. It provides an effective means for observing the algorithmic complexity of programs with a mixture of algorithms and black‐box software through visualization. Through two case studies, we demonstrate the effectiveness of complexity plots in complexity analysis in research, education and application.
Source: Computer Graphics Forum
DOI: 10.1111/cgf.12098
Authors: Jeyarajan Thiyagalingam, Simon Walton, Brian Duffy, Anne Trefethen, Min Chen
Institution: University of Oxford
Language: English
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
Awards: G551029724, G7720321561
OpenAlex ID: W2913437991
