Lazy Polytypic Functional Visualisation
This project aims to re-express well-known visualisation algorithms (e.g. volumetric surface extraction) in the functional language Haskell. We will be exploring how to make those algorithms:
- lazy, so that the whole dataset is not required all at once;
- datatype-generic (polytypic), so that the algorithm is independent of the original dataset storage format, including questions of irregular and unstructured sampling;
- grid-enabled, such that it is possible to distribute the processing tasks across a heterogeneous network of machines, harnessing any implicit parallelism in the algorithms to speed up the calculation for huge datasets.
This trac website is mainly for internal use of the project members. See our official website for a more visitor-friendly experience.
Visitors from IEEE Visualization
If you saw our paper at the IEEE Visualization 2006 conference and want to know more, you can get hold of the full code including the test scripts used to gather the performance results. Important Update: we discovered some problems with the method used to collect the performance figures in the paper. Here is an explanation and restatement of the figures. (There is some good news, and some bad news.)
Site organisation
- The Plan - a rough guide to what we intend to do, when, and who.
- Notes from meetings - a chronological record of discussions at working meetings.
- Memos - short informal notes describing half-baked ideas.
- Bibliography - books and papers we should be familiar with.
- Papers - papers we are writing (have written) as part of this project.
Admin
Information about the Trac system.
Members of this project are:
- Rita Borgo
- David Duke
- Colin Runciman
- Malcolm Wallace
The project is a collaboration between the Departments of Computer Science at the Universities of Leeds and York, and is funded by the UK's Engineering and Physical Sciences Research Council, under the e-Science programme.
