You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of Leeds » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of Leeds

Return to search Previous output Next output

Output 0 of 0 in the submission

Article title

Subdivision Analysis of the Trilinear Interpolant

Type

D - Journal article

DOI

10.1109/TVCG.2009.10

Title of journal

IEEE Transactions on Visualization and Computer Graphics

Article number

Volume number

Issue number

First page of article

533

ISSN of journal

1077-2626

Year of publication

2010

URL

Number of additional authors

Additional information

<20>Marching Cubes is the most important algorithm in visualisation and important across computer graphics. This paper, in collaboration with Nelson Max (LLNL), one of the world's leading visualisation experts, reduced the cases from over 40 to two basic configurations, and established that topologically correct subdivisions must divide at critical points rather than arbitrary midpoints (Utah/NYU, DOI:10.1016/j.cag.2013.04.004). This analysis has been used as part of modern validation tools for visualisation software (10.1109/TVCG.2011.109), and leads to correct analysis of more complex interpolants, such as time-varying data (Utah: DOI:10.1109/TVCG.2011.74), and to improved rendering (Stuttgart/Leeds, DOI:10.1109/TVCG.2010.145).

Interdisciplinary

Cross-referral requested

Research group

None

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract