Opacity Optimization for Surfaces

In flow visualization, integral surfaces rapidly tend to expand, fold and produce vast amounts of occlusion. While silhouette enhancements and local transparency mappings proved useful for semi‐transparent depictions, they still introduce visual clutter when surfaces grow more complex. An effective...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computer graphics forum Ročník 33; číslo 3; s. 11 - 20
Hlavní autori: Günther, Tobias, Schulze, Maik, Esturo, Janick Martinez, Rössl, Christian, Theisel, Holger
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Oxford Blackwell Publishing Ltd 01.06.2014
Predmet:
Analysis
Balancing
Categories and Subject Descriptors (according to ACM CCS)
Computer graphics
Fluids
I.3.3 [Computer Graphics]: Three-Dimensional Graphics and Realism-Display Algorithms
Image processing systems
Interactive
Least squares method
Occlusion
Opacity
Optimization
Rendering
Studies
Visualization
ISSN:0167-7055, 1467-8659
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:In flow visualization, integral surfaces rapidly tend to expand, fold and produce vast amounts of occlusion. While silhouette enhancements and local transparency mappings proved useful for semi‐transparent depictions, they still introduce visual clutter when surfaces grow more complex. An effective visualization of the flow requires a balance between the presentation of interesting surface parts and the avoidance of occlusions that hinder the view. In this paper, we extend the concept of opacity optimization to surfaces to obtain a global approach to the occlusion problem. Starting with a partition of the surfaces into patches, we compute per‐patch opacity as minimizer of a bounded‐variable least‐squares problem. For the final rendering, opacity is interpolated on the surfaces. The resulting visualization technique is interactive, frame‐coherent, view‐dependent and driven by domain knowledge.
Bibliografia:ark:/67375/WNG-LM2M41CD-P
ArticleID:CGF12357
istex:598CF59A5539850CE34A2072FAC5B7B481AB7ADC
Supporting Information
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:0167-7055
1467-8659
DOI:10.1111/cgf.12357