Visualization of discrete gradient construction

Authors:
Attila Gyulassy;Joshua Aaron Levine;Valerio Pascucci
Affiliations:
University of Utah, Salt Lake City, UT, USA;University of Utah, Salt Lake City, UT, USA;University of Utah, Salt Lake City, UT, USA
Venue:
Proceedings of the twenty-seventh annual symposium on Computational geometry
Year:
2011

Citing 2
Cited 0

Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms

SCG '88 Proceedings of the fourth annual symposium on Computational geometry
A Practical Approach to Morse-Smale Complex Computation: Scalability and Generality

IEEE Transactions on Visualization and Computer Graphics

Quantified Score

Hi-index	0.01

Visualization

Abstract

This video presents a visualization of a recent algorithm to compute discrete gradient fields on regular cell complexes. Discrete gradient fields are used in practical methods that robustly translate smooth Morse theory to combinatorial domains. We describe the stages of the algorithm, highlighting both its simplicity and generality.