Adaptive Distance Grid Based Algorithm for Farthest Point Seeding Streamline Placement
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 metho...
Main Author: | Mebarki Abdelkrim |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2016-07-01
|
Series: | Open Computer Science |
Subjects: | |
Online Access: | https://doi.org/10.1515/comp-2016-0007 |
Similar Items
-
Streamline Uniform Placement Algorithm With Dynamic Seed Points
by: Xujia Qin, et al.
Published: (2019-01-01) -
Fridtjof Nansen’s <i>Farthest North</i>: Scientific Report or Personal Account?
by: Silje Solheim Karlsen
Published: (2008-02-01) -
Group Processing of Multiple k-Farthest Neighbor Queries in Road Networks
by: Hyung-Ju Cho, et al.
Published: (2020-01-01) -
Streamlines based visualization of air flow in clouds
by: Kovačević Marko M., et al.
Published: (2012-01-01) -
A Voronoi-Based Group Reverse k Farthest Neighbor Query Method in the Obstacle Space
by: Yongshan Liu, et al.
Published: (2020-01-01)