University of North Texas
Force-Directed Graph Drawing and Aesthetics Measurement in a Non-Strict Pure Functional Programming Language
Abstract
dc:descriptionNon-strict pure functional programming often requires redesigning algorithms and data structures to work more effectively under new constraints of non-strict evaluation and immutable state. Graph drawing algorithms, while numerous and broadly studied, have no presence in the non-strict pure functional programming model. Additionally, there is currently no freely licensed standalone toolkit used to quantitatively analyze aesthetics of graph drawings. This thesis addresses two previously unexplored questions. Can a force-directed graph drawing algorithm be implemented in a non-strict functional language, such as Haskell, and still be practically usable? Can an easily extensible aesthetic measuring tool be implemented in a language such as Haskell and still be practically usable? The focus of the thesis is on implementing one of the simplest force-directed algorithms, that of Fruchterman and Reingold, and comparing its resulting aesthetics to those of a well-known C++ implementation of the same algorithm.
Degree
thesis:*- Grantor dc:publisher
- University of North Texas
- Year dc:date
- 2009
Author and committee
dc:creator, dc:contributor.*- Author dc:creator
-
- Gaconnet, Christopher James
- Contributors dc:contributor
-
- Tarau, Paul
- Sweany, Philip H.
- Jacob, Roy T.
- Garlick, Ryan
Subjects
dc:subject × 8Rights
dc:rights- Statement dc:rights
-
- Public
- Copyright
- Gaconnet, Christopher James
- Copyright is held by the author, unless otherwise noted. All rights reserved.
- Language dc:language
- English
Identifiers
dc:identifier.*- Identifier
-
oclc: 608023907
untcat: b3828015
https://digital.library.unt.edu/ark:/67531/metadc12125/
ark: ark:/67531/metadc12125