Dual streamline seeding

Rosanwo, Olufemi; Petz, Christoph; Prohaska, Steffen; Hege, Hans-Christian; Hotz, Ingrid

doi:10.1109/pacificvis.2009.4906832

Cited by 37 publications

(16 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The particles within a neighborhood communicate with one another. Several neighborhoods have been studied and are considered in terms of particle identifiers and not only topological information such as Euclidean distances in the search space [16,17] (See Figure).…”

Section: Neighborhood Definitionmentioning

confidence: 99%

PSO-Based Optimization of 2D Streamline Placement

2017

International Journal of Research Studies in Computer Science a

View full text Add to dashboard Cite

Section: Neighborhood Definitionmentioning

confidence: 99%

PSO-Based Optimization of 2D Streamline Placement

2017

International Journal of Research Studies in Computer Science a

View full text Add to dashboard Cite

“…In [6], the authors introduced the notion of dual streamlines that are orthogonal to the given vector field as opposed to primal streamlines that are tangential. Seeds for new streamlines are only placed along these curves.…”

Section: Previous Workmentioning

confidence: 99%

Adaptive Distance Grid Based Algorithm for Farthest Point Seeding Streamline Placement

Mebarki

2016

Open Computer Science

View full text Add to dashboard Cite

Streamlines are commonly used in scientific visualization. They are the most used geometric items in primitive-based visualization algorithms. In this paper, a modified version of the farthest point seeding strategy streamline placement is presented. The main advantage compared to the original method is the use of a simple easy to implement underlying data structure. The Delaunay triangulation used in the original algorithm is heavy and susceptible to the calculation robustness errors. The distances between lines and the localization of the biggest void in the domain are approximated using the Delaunay triangulation. This paper presents an adaptive distance grid to model the visualization domain and incorporate anywhere the local distance to all the other streamlines and the boundaries exactly without any approximation. The streamlines are started at the farthest point from all the existing ones and the domain boundaries. The localization of the seed point position is directly accessible via the distance adaptive grid. The grid update is direct too, and is done by a greedy algorithm avoiding any additional cost. The obtained results are sufficient, and the extension to multi-resolution is straight and simple.

show abstract

“…Examples for seed placement include image-guided placement [17], evenly-spaced seeding [6], featureguided seeding [19], farthest seed placement [12], image-based placement [8], dual seeding [13], surface seeding [14] and entropybased seeding [21]. For streamline selection, several research efforts utilized concepts from information theory to quantify the importance of streamlines for selection [11,7,10].…”

Section: Related Workmentioning

confidence: 99%

FlowTour: An Automatic Guide for Exploring Internal Flow Features

Walker

Wang

et al. 2014

2014 IEEE Pacific Visualization Symposium

View full text Add to dashboard Cite

We present FlowTour, a novel framework that provides an automatic guide for exploring internal flow features. Our algorithm first identifies critical regions and extracts their skeletons for feature characterization and streamline placement. We then create candidate viewpoints based on the construction of a simplified mesh enclosing each critical region and select best viewpoints based on a viewpoint quality measure. Finally, we design a tour that traverses all selected viewpoints in a smooth and efficient manner for visual navigation and exploration of the flow field. Unlike most existing works which only consider external viewpoints, a unique contribution of our work is that we also incorporate internal viewpoints to enable a clear observation of what lies inside of the flow field. Our algorithm is thus particularly useful for exploring hidden or occluded flow features in a large and complex flow field. We demonstrate our algorithm with several flow data sets and perform a user study to confirm the effectiveness of our approach.

show abstract

Dual streamline seeding

Cited by 37 publications

References 21 publications

PSO-Based Optimization of 2D Streamline Placement

PSO-Based Optimization of 2D Streamline Placement

Adaptive Distance Grid Based Algorithm for Farthest Point Seeding Streamline Placement

FlowTour: An Automatic Guide for Exploring Internal Flow Features

Contact Info

Product

Resources

About