Handle URI:
http://hdl.handle.net/10754/597818
Title:
Complexity Plots
Authors:
Thiyagalingam, Jeyarajan; Walton, Simon; Duffy, Brian; Trefethen, Anne; Chen, Min
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.
Citation:
Thiyagalingam J, Walton S, Duffy B, Trefethen A, Chen M (2013) Complexity Plots. Computer Graphics Forum 32: 111–120. Available: http://dx.doi.org/10.1111/cgf.12098.
Publisher:
Wiley-Blackwell
Journal:
Computer Graphics Forum
KAUST Grant Number:
KUK-C1-013-04
Issue Date:
Jun-2013
DOI:
10.1111/cgf.12098
Type:
Article
ISSN:
0167-7055
Sponsors:
The authors wish to thank the partial support from several funding bodies, including James Martin Foundation, and UK EPSRC. This publication is based on work supported by Award No. KUK-C1-013-04, made by King Abdullah University of Science and Technology (KAUST).
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorThiyagalingam, Jeyarajanen
dc.contributor.authorWalton, Simonen
dc.contributor.authorDuffy, Brianen
dc.contributor.authorTrefethen, Anneen
dc.contributor.authorChen, Minen
dc.date.accessioned2016-02-25T12:57:15Zen
dc.date.available2016-02-25T12:57:15Zen
dc.date.issued2013-06en
dc.identifier.citationThiyagalingam J, Walton S, Duffy B, Trefethen A, Chen M (2013) Complexity Plots. Computer Graphics Forum 32: 111–120. Available: http://dx.doi.org/10.1111/cgf.12098.en
dc.identifier.issn0167-7055en
dc.identifier.doi10.1111/cgf.12098en
dc.identifier.urihttp://hdl.handle.net/10754/597818en
dc.description.abstractIn 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.en
dc.description.sponsorshipThe authors wish to thank the partial support from several funding bodies, including James Martin Foundation, and UK EPSRC. This publication is based on work supported by Award No. KUK-C1-013-04, made by King Abdullah University of Science and Technology (KAUST).en
dc.publisherWiley-Blackwellen
dc.titleComplexity Plotsen
dc.typeArticleen
dc.identifier.journalComputer Graphics Forumen
dc.contributor.institutionUniversity of Oxford, Oxford, United Kingdomen
kaust.grant.numberKUK-C1-013-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.