Hierarchical opacity optimization for sets of 3D line fields
The selection of meaningful lines for 3D line data visualization has been intensively researched in recent years. Most approaches focus on single line fields where one line passes through each domain point. This paper presents a selection approach for sets of line fields which is based on a global o...
Saved in:
Published in | Computer graphics forum Vol. 33; no. 2; pp. 507 - 516 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Oxford
Blackwell Publishing Ltd
01.05.2014
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | The selection of meaningful lines for 3D line data visualization has been intensively researched in recent years. Most approaches focus on single line fields where one line passes through each domain point. This paper presents a selection approach for sets of line fields which is based on a global optimization of the opacity of candidate lines. For this, existing approaches for single line fields are modified such that significantly larger amounts of line representatives are handled. Furthermore, time coherence is addressed for animations, making this the first approach that solves the line selection problem for 3D time‐dependent flow. We apply our technique to visualize dense sets of pathlines, sets of magnetic field lines, and animated sets of pathlines, streaklines and masslines. |
---|---|
Bibliography: | ArticleID:CGF12336 istex:1F60F38B1092904B1E5781E4DE2F90304A96DE55 Supporting Information ark:/67375/WNG-MXZW3Q6S-C SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
ISSN: | 0167-7055 1467-8659 |
DOI: | 10.1111/cgf.12336 |