Opacity optimization for 3D line fields
Authors:
Open Access
- 21 July 2013
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 32 (4) , 1-8
Abstract
For the visualization of dense line fields, the careful selection of lines to be rendered is a vital aspect. In this paper, we present a global line selection approach that is based on an optimization process. Starting with an initial set of lines that covers the domain, all lines are rendered with a varying opacity, which is subject to the minimization of a bounded-variable least-squares problem. The optimization strives to keep a balance between information presentation and occlusion avoidance. This way, we obtain view-dependent opacities of the line segments, allowing a real-time free navigation while minimizing the danger of missing important structures in the visualization. We compare our technique with existing local and greedy approaches and apply it to data sets in flow visualization, medical imaging, physics, and computer graphics.Keywords
This publication has 19 references indexed in Scilit:
- Similarity Measures for Enhancing Interactive Streamline SeedingIEEE Transactions on Visualization and Computer Graphics, 2012
- A Unified Approach to Streamline Selection and Viewpoint Selection for 3D Flow VisualizationIEEE Transactions on Visualization and Computer Graphics, 2012
- A survey of raster-based transparency techniquesComputers & Graphics, 2011
- Decay of helical and nonhelical magnetic knotsPhysical Review E, 2011
- Information Theory in Scientific VisualizationEntropy, 2011
- Real‐Time Concurrent Linked List Construction on the GPUComputer Graphics Forum, 2010
- A Streamline Selection Technique for Integrated Scalar and Vector VisualizationThe Journal of the Society for Art and Science, 2009
- Image enhancement by unsharp masking the depth bufferACM Transactions on Graphics, 2006
- Strategies for interactive exploration of 3D flow using evenly-spaced illuminated streamlines2003
- A Reflective Newton Method for Minimizing a Quadratic Function Subject to Bounds on Some of the VariablesSIAM Journal on Optimization, 1996