Computer Graphics Laboratory ETH Zurich


Decoupled Opacity Optimization for Points, Lines and Surfaces

T. Günther, H. Theisel, M. Gross

To appear: Proceedings of Eurographics (Lyon,France, April 24-28, 2017), Computer Graphics Forum, vol. 36, no. 2
[Abstract] [BibTeX] [PDF] [Video]


Displaying geometry in flow 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.

[Download Video]

author = {G{\"u}nther, Tobias and Theisel, Holger and Gross, Markus},
title = {Decoupled Opacity Optimization for Points, Lines and Surfaces},
journal = {Computer Graphics Forum (Proc. Eurographics)},
year = {2017},
volume = {36},
number = {2},
pages = {to appear},
[Download BibTeX]


Download Paper
Download Video