DeBruijn Counting for Visualization Algorithms

Autor:	Paul K. Stockmeyer, David C. Banks
Rok vydání:	2009
Předmět:	Vertex (graph theory) Polynomial Marching cubes Cycle index Computer science Interval (graph theory) Polytope Function (mathematics) Algorithm Visualization
Zdroj:	Mathematics and Visualization ISBN: 9783540250760 Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration
Popis:	We describe how to determine the number of cases that arise in visualization al- gorithms such as Marching Cubes by applying the deBruijn extension of Polya counting. This technique constructs a polynomial, using the cycle index, encoding the case counts that arise when a discrete function (or “color”) is evaluated at each vertex of a polytope. The technique can serve as a valuable aid in debugging visualization algorithms that extend Marching Cubes, Separating Surfaces, Interval Volumes, Sweeping Simplices, etc., to larger dimensions and to more colors.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::2d1b4d31ef77c27093bb9e5fc751cd09 https://doi.org/10.1007/b106657_4 Zobrazit plný text záznamu