Decoupled Opacity Optimization for Points, Lines and Surfaces. (23rd May 2017)

• Record Type: Journal Article
• Authors: Günther, Tobias; Theisel, Holger; Gross, Markus
• Is Part Of: Computer graphics forum. Volume 36:Number 2(2017)
• Page Start: 153
• Page End: 162
• Publication Date: 2017-05-23
• Subjects: Categories and Subject Descriptors (according to ACM CCS) -- I.3.3 [Computer Graphics]: Picture/Image Generation—Line and curve generation; Computer graphics -- Periodicals; 006.605
• DOI: 10.1111/cgf.13115
• Languages: English
• ISSNs: 0167-7055

Abstract

Abstract: Displaying geometry inflow visualization is often accompanied by occlusion problems, making it difficult to perceive information that is relevant in the respective application. In a recent technique, named opacity optimization, the balance of occlusion avoidance and the selection of meaningful geometry was recognized to be a view‐dependent, global optimization problem. The method solves a bounded‐variable least‐squares problem, which minimizes energy terms for the reduction of occlusion, background clutter, adding smoothness and regularization. The original technique operates on an object‐space discretization and was shown for line and surface geometry. Recently, it has been extended to volumes, where it was solved locally per ray by dropping the smoothness energy term and replacing it by pre‐filtering the importance measure. In this paper, we pick up the idea of splitting the opacity optimization problem into two smaller problems. The first problem is a minimization with analytic solution, and the second problem is a smoothing of the obtained minimizer in object‐space. Thereby, the minimization problem can be solved locally per pixel, making it possible to combine all geometry types (points, lines and surfaces) consistently in a single optimization framework. We call this decoupled opacity optimization and apply it to a number of steady 3D vector fields.