Topology-guided accelerated vector field streamline visualization
保存先:
| 出版年: | The Visual Computer vol. 41, no. 1 (Jan 2025), p. 709 |
|---|---|
| 出版事項: |
Springer Nature B.V.
|
| 主題: | |
| オンライン･アクセス: | Citation/Abstract Full Text Full Text - PDF |
| タグ: |
タグなし, このレコードへの初めてのタグを付けませんか!
|
MARC
| LEADER | 00000nab a2200000uu 4500 | ||
|---|---|---|---|
| 001 | 3159547716 | ||
| 003 | UK-CbPIL | ||
| 022 | |a 0178-2789 | ||
| 022 | |a 1432-2315 | ||
| 024 | 7 | |a 10.1007/s00371-024-03357-8 |2 doi | |
| 035 | |a 3159547716 | ||
| 045 | 2 | |b d20250101 |b d20250131 | |
| 245 | 1 | |a Topology-guided accelerated vector field streamline visualization | |
| 260 | |b Springer Nature B.V. |c Jan 2025 | ||
| 513 | |a Journal Article | ||
| 520 | 3 | |a Streamline visualization is crucial for understanding 3D vector fields, and seed placement is essential for high-quality streamlines. Current algorithms are either uniform, omitting vital information, or slow due to precalculation. We propose three novel techniques to build a topology-guided accelerated vector field streamline visualization framework. First, we convert the tracing process into an iterative one, dynamically generating seed points based on critical region detection and a cooldown mechanic. Second, we introduce “planar critical points” combined with traditional critical points to identify critical regions, and place new seed points according to their critical point types. During this process, we circumvent complex eigenvalue calculation with determining whether the eigenvalues are real, which is enough for our placement strategies. Third, we offer a fast streamline simplification technique based on global distortion to reduce clutter. Based on the proposed streamline visualization framework and various vector field visualization methods, we develop a CUDA-based application tool called AdaptiFlux, which achieves real-time visualization of vector fields more efficiently than those representative visualization tools. | |
| 653 | |a Eigenvalues | ||
| 653 | |a Algorithms | ||
| 653 | |a Placement | ||
| 653 | |a Datasets | ||
| 653 | |a Fields (mathematics) | ||
| 653 | |a Clutter | ||
| 653 | |a Real time | ||
| 653 | |a Information theory | ||
| 653 | |a Visualization | ||
| 653 | |a Critical point | ||
| 653 | |a Topology | ||
| 773 | 0 | |t The Visual Computer |g vol. 41, no. 1 (Jan 2025), p. 709 | |
| 786 | 0 | |d ProQuest |t Advanced Technologies & Aerospace Database | |
| 856 | 4 | 1 | |3 Citation/Abstract |u https://www.proquest.com/docview/3159547716/abstract/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text |u https://www.proquest.com/docview/3159547716/fulltext/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |
| 856 | 4 | 0 | |3 Full Text - PDF |u https://www.proquest.com/docview/3159547716/fulltextPDF/embedded/7BTGNMKEMPT1V9Z2?source=fedsrch |