Refine
Year of publication
Document Type
- In Proceedings (14)
- Article (13)
- In Collection (7)
- ZIB-Report (6)
- Book chapter (4)
- Other (2)
- Poster (1)
Language
- English (47)
Keywords
This work introduces a novel streamline seeding technique based on dual streamlines that are orthogonal to the vector field, instead of tangential. The greedy algorithm presented here produces a net of orthogonal streamlines that is iteratively refined resulting in good domain coverage and a high degree of continuity and uniformity. The algorithm is easy to implement and efficient, and it naturally extends to curved surfaces.
Dual Streamline Seeding
(2009)
We propose a combinatorial algorithm to track critical points of 2D
time-dependent scalar fields. Existing tracking algorithms such as Feature
Flow Fields apply numerical schemes utilizing derivatives of the data,
which makes them prone to noise and involve a large number of computational
parameters. In contrast, our method is robust against noise
since it does not require derivatives, interpolation, and numerical integration.
Furthermore, we propose an importance measure that combines the
spatial persistence of a critical point with its temporal evolution. This
leads to a time-aware feature hierarchy, which allows us to discriminate
important from spurious features. Our method requires only a single,
easy-to-tune computational parameter and is naturally formulated in an
out-of-core fashion, which enables the analysis of large data sets. We apply
our method to a number of data sets and compare it to the stabilized
continuous Feature Flow Field tracking algorithm.