Results 171 to 180 of about 11,152,389 (276)

Topology‐based Visual Analysis of Hydrothermal Plumes

open access: yesComputer Graphics Forum, EarlyView.
Abstract Hydrothermal plumes are turbulent structures of intense heat and mineral smoke that rise and disperse into the deep ocean. Existing models generally characterize these systems as a single axisymmetric plume originating from a point source. However, this assumption breaks down in weakly venting, spatially distributed systems, where low‐flux ...
Adhitya Kamakshidasan   +3 more
wiley   +1 more source

Evaluating the Perceptual Space of Surface Noise for Visualization

open access: yesComputer Graphics Forum, EarlyView.
Abstract Surface noise provides a geometric alternative to color for encoding scalar information on surfaces, yet its perceptual characteristics remain insufficiently understood. We present a systematic investigation of how variations in noise amplitude and frequency are perceived when applied to 3D surfaces. Across three online perceptual studies with
A. Sterzik, N. Merk, K. Lawonn
wiley   +1 more source

Scalable Computation of Topological Abstractions for Scalar Data

open access: yesComputer Graphics Forum, EarlyView.
Abstract Topological data analysis has become an important tool for large scale scalar data analysis and visualization, efficiently extracting the inherent structure and features of interest of the data. However, with growing dataset sizes and complexity, it is increasingly becoming infeasible to compute topological abstractions of interest in serial ...
M. Will   +6 more
wiley   +1 more source

The Story(line) So Far: A Survey on Storyline Visualization

open access: yesComputer Graphics Forum, EarlyView.
Abstract Storyline visualizations model narratives as temporal networks, using x‐monotone lines to represent entities and their interactions over time. This technique offers an intuitive way to reveal structural patterns over time, such as character co‐occurrence and narrative flow.
S. Di Bartolomeo   +4 more
wiley   +1 more source

Meshing Unsigned Distance Fields with Regular Triangulations

open access: yesComputer Graphics Forum, EarlyView.
Abstract Unsigned distance fields (UDF) are a versatile, implicit representation of geometry. They can represent surfaces that are not bounding a solid or contain points or curves that are not manifold, for example several sheets meeting along a common curve. Contouring the implicit representation, i.e. turning it into an explicit one, requires finding
M. Kohlbrenner, M. Alexa
wiley   +1 more source

A practical algorithm for weighted k‐hulls

open access: yesComputer Graphics Forum, EarlyView.
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley   +1 more source

Home - About - Disclaimer - Privacy