DeBruijn Counting for Visualization Algorithms

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 Pólya counting. This technique constructs a polynomial, using the cycle index, encoding the case counts that arise when a discrete function (or “colo...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Banks, David C., Stockmeyer, Paul K.
Format:	Buchkapitel
Sprache:	eng
Schlagworte:	Black Vertex Color Group Computer science Computing: general Infinite series Permutation Group Power Group White Vertex
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!