Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/de-gruyter/adaptive-distance-grid-based-algorithm-for-farthest-point-seeding-b47U5O0d6k
References (24)
-
(2016)
Haemel, OpenGL SuperBible, Seventh -
Lijie Xu, Teng-Yok Lee, Han-Wei Shen (2010)
An Information-Theoretic Framework for Flow VisualizationIEEE Transactions on Visualization and Computer Graphics, 16
-
Abdelkrim Mebarki, P. Alliez, O. Devillers (2005)
Farthest point seeding for efficient placement of streamlinesVIS 05. IEEE Visualization, 2005.
-
Xiaohong Ye, D. Kao, A. Pang (2005)
Strategy for seeding 3D streamlinesVIS 05. IEEE Visualization, 2005.
-
Greg Turk, D. Banks (1996)
Image-guided streamline placementProceedings of the 23rd annual conference on Computer graphics and interactive techniques
-
B. Spencer, R. Laramee, Guoning Chen, E. Zhang (2009)
Evenly Spaced Streamlines for Surfaces: An Image‐Based ApproachComputer Graphics Forum, 28
-
X. Tricoche (2002)
Vector and tensor field topology simplification, tracking, and visualization -
B. Jobard, W. Lefer (1997)
Creating Evenly-Spaced Streamlines of Arbitrary Density -
(2003)
International Organisation for Standardisation, I. 14882, Programming Languages c++ -
Verma (2000)
A flow - guided streamline seeding strategy In Proceedings of Visualization Salt Lake City UtahIEEE October USA, 00
-
Alliez (2005)
Farthest Point Seeding for Eflcient Placement of Streamlines In Proceedings of Visualization Minneapolis MinosotaIEEE October USA, 05
-
Ye (2005)
Strategy for seeding streamlines In Proceeding of VisualizationIEEE October, 05
-
A. Fuhrmann, E. Gröller (1998)
Real-time techniques for 3D flow visualizationProceedings Visualization '98 (Cat. No.98CB36276)
-
C. Becker, R. Fried, S. Kuhnt (2013)
Robustness and Complex Data Structures -
Rosanwo (2009)
Dual Streamline Seeding In Proceedings of Pacific Visualization Beijing ChinaIEEE Symposium, 9
-
(1997)
Out-of-core streamline visualization -
Fuhrmann (1998)
Real - time techniques for flow visualization In Proceedings of Visualization Research Triangle Park NCIEEE October USA, 98
-
Liya Li, Han-Wei Shen (2007)
Image-based streamline generation and renderingIEEE Transactions on Visualization and Computer Graphics, 13
-
Schlemmer (2007)
Priority streamlines : a context - based visualization of flow fields In Proceeding of the th Joint Eurographics IEEE VGTC symposiom on Visualization Aire - la - Ville Switzerland SwitzerlandIEEE, 9
-
Manuel Caroli, Pedro Castro, Sébastien Loriot, Olivier Rouiller, M. Teillaud, Camille Wormser (2010)
Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere -
Olufemi Rosanwo, Christoph Petz, S. Prohaska, H. Hege, I. Hotz (2009)
Dual streamline seeding2009 IEEE Pacific Visualization Symposium
-
Michael Schlemmer, I. Hotz, B. Hamann, Florian Morr, H. Hagen (2007)
Priority Streamlines: A context-based Visualization of Flow Fields -
Vivek Verma, D. Kao, A. Pang (2000)
A flow-guided streamline seeding strategyProceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145)
-
K. Mehlhorn, S. Schirra, P. Laurent, P. Sablonnière, L. Schumaker (2000)
Geometric Computing with CGAL and LEDA
- Publisher
- de Gruyter
- Copyright
- Copyright © 2016 by the
- ISSN
- 2299-1093
- eISSN
- 2299-1093
- DOI
- 10.1515/comp-2016-0007
- Publisher site
- See Article on Publisher Site
Abstract
Abstract 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.
Journal
Open Computer Science – de Gruyter
Published: Jul 11, 2016