Complexity Plots

Jeyarajan Thiyagalingam, Simon Walton, Brian Duffy, Anne Trefethen, Min Chen

Research output: Contribution to journalArticlepeer-review

2 Scopus citations

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. © 2013 The Author(s) Computer Graphics Forum © 2013 The Eurographics Association and Blackwell Publishing Ltd.
Original languageEnglish (US)
Pages (from-to)111-120
Number of pages10
JournalComputer Graphics Forum
Volume32
Issue number3pt1
DOIs
StatePublished - Jul 1 2013
Externally publishedYes

Fingerprint Dive into the research topics of 'Complexity Plots'. Together they form a unique fingerprint.

Cite this