Deutsch
 
Hilfe Datenschutzhinweis Impressum
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Buchkapitel

Efficient Computation of a Hierarchy of Discrete 3D Gradient Vector Fields

MPG-Autoren
/persons/resource/persons123492

Weinkauf,  Tino
Computer Graphics, MPI for Informatics, Max Planck Society;

Externe Ressourcen
Es sind keine externen Ressourcen hinterlegt
Volltexte (beschränkter Zugriff)
Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.
Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte in PuRe verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Günther, D., Reininghaus, J., Prohaska, S., Weinkauf, T., & Hege, H.-C. (2012). Efficient Computation of a Hierarchy of Discrete 3D Gradient Vector Fields. In R. Peikert, H. Hauser, H. Car, & R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II (pp. 15-29). New York, NY: Springer.


Zitierlink: https://hdl.handle.net/11858/00-001M-0000-0015-0DD8-0
Zusammenfassung
This paper introduces a novel combinatorial algorithm to compute a hierarchy of discrete gradient vector fields for three-dimensional scalar fields. The hierarchy is defined by an importance measure and represents the combinatorial gradient flow at different levels of detail. The presented algorithm is based on Forman�s discrete Morse theory, which guarantees topological consistency and algorithmic robustness. In contrast to previous work, our algorithm combines memory and runtime efficiency. It thereby lends itself to the analysis of large data sets. A discrete gradient vector field is also a compact representation of the underlying extremal structures � the critical points, separation lines and surfaces. Given a certain level of detail, an explicit geometric representation of these structures can be extracted using simple and fast graph algorithms.