ExTreeM : Scalable Augmented Merge Tree Computation via Extremum Graphs
Over the last decade merge trees have been proven to support a plethora of visualization and analysis tasks since they effectively abstract complex datasets. This paper describes the ExTreeM-Algorithm: A scalable algorithm for the computation of merge trees via extremum graphs. The core idea of ExTr...
Description complète
Détails bibliographiques
| Publié dans: | IEEE transactions on visualization and computer graphics. - 1996. - 30(2024), 1 vom: 23. Jan., Seite 1085-1094
|
|---|
| Auteur principal: |
Lukasczyk, Jonas
(Auteur) |
|---|
| Autres auteurs: |
Will, Michael,
Wetzels, Florian,
Weber, Gunther H,
Garth, Christoph |
|---|
| Format: | Article en ligne
|
|---|
| Langue: | English |
|---|
| Publié: |
2024
|
|---|
| Accès à la collection: | IEEE transactions on visualization and computer graphics
|
|---|
| Sujets: | Journal Article |
|---|