The Marching Cubes algorithm, and its relatives and generalisation, such as Sweeping Simplices, are widely used techniques to find, and triangulate, surfaces in three or higher dimensional data sets. These algorithms involve large tables of triangulations for local subconfigurations, which can usefully be reduced by taking account the symmetries of the problem. This has traditionally been done by hand on an ad hoc basis which does not scale to the more complex generalisations of the algorithm.
This talk will explain how we put this process on systematic basis using computational group theory and determine and catalogue the essentially distinct configurations in a variety of settings.
Last modified: Tuesday, 26-Feb-2008 08:13:18 NZDT
This page is maintained by the seminar list administrator .