CSDL Home IEEE Transactions on Visualization & Computer Graphics 2004 vol.10 Issue No.04 - July/August
Issue No.04 - July/August (2004 vol.10)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TVCG.2004.6
<p><b>Abstract</b>—We describe how to count the cases that arise in a family of visualization techniques, including Marching Cubes, Sweeping Simplices, Contour Meshing, Interval Volumes, and Separating Surfaces. Counting the cases is the first step toward developing a generic visualization algorithm to produce substitopes (geometric substitutions of polytopes). We demonstrate the method using "GAP,” a software system for computational group theory. The case-counts are organized into a table that provides a taxonomy of members of the family; numbers in the table are derived from actual lists of cases, which are computed by our methods. The calculations confirm previously reported case-counts for four dimensions that are too large to check by hand and predict the number of cases that will arise in substitope algorithms that have not yet been invented. We show how Pólya theory produces a closed-form upper bound on the case counts.</p>
Isosurface, level set, group action, orbit, geometric substitution, Marching Cubes, separating surface, Pólya counting, substitope.
David C. Banks, Stephen A. Linton, Paul K. Stockmeyer, "Counting Cases in Substitope Algorithms", IEEE Transactions on Visualization & Computer Graphics, vol.10, no. 4, pp. 371-384, July/August 2004, doi:10.1109/TVCG.2004.6