Open AccessProceedings Article
An Efficient Point Location Method for Visualization in Large Unstructured Grids.
Max Langbein,Gerik Scheuermann,Xavier Tricoche,Fachbereich Informatik +3 more
- pp 27-35
Reads0
Chats0
TLDR
A memory efcient, fast in-core solution to the problem using cell adjacency and a complete adaptive kd-tree based on the vertices and the data structure is tested on several large unstructured grids from computational uid dynamics (CFD) simulations for industrial applications.Abstract:
Visualization of data dened over large unstructured grids requires an efcient solution to the point location problem, since many visualization methods need values at arbitrary positions given in global coordinates. This paper presents a memory efcient, fast in-core solution to the problem using cell adjacency and a complete adaptive kd-tree based on the vertices. Since cell adjacency information is stored rather often (for example for fast ray-casting or streamline integration), the extra memory needed is very small compared to conventional solutions like octrees. The method is especially useful for highly non-uniform point distributions and extreme edge ratios in the cells. The data structure is tested on several large unstructured grids from computational uid dynamics (CFD) simulations for industrial applications.read more
Citations
More filters
Proceedings ArticleDOI
Surface techniques for vortex visualization
TL;DR: An improved method for stream surface computation that delivers accurate results in regions of intricate flow is presented, along with a novel method to determine boundary surfaces of vortex cores.
Journal ArticleDOI
Generation of Accurate Integral Surfaces in Time-Dependent Vector Fields
TL;DR: This work describes an algorithm for surface integration that approximates a series of time lines using iterative refinement and computes a skeleton of the integral surface, which allows a highly accurate treatment of very large time-varying vector fields in an efficient, streaming fashion.
Proceedings ArticleDOI
Visualization of Intricate Flow Structures for Vortex Breakdown Analysis
Xavier Tricoche,Christoph Garth,Gordon Kindlmann,Eduard Deines,Gerik Scheuermann,Markus Ruetten,Charles Hansen +6 more
TL;DR: This paper addresses the challenges raised by the visual exploration and validation of two CFD simulations involving vortex breakdown by proposing a new approach that unfolds the geometry of the breakdown region by letting a plane travel through the structure along a curve.
Journal ArticleDOI
Fast, Memory-Efficient Cell Location in Unstructured Grids for Visualization
Christoph Garth,Kenneth I. Joy +1 more
TL;DR: This paper proposes a data structure and associated construction algorithm for fast cell location in unstructured grids, and applies it to the interpolation problem based on the concept of bounding interval hierarchies, which is memory-efficient, fast and numerically robust.
Journal ArticleDOI
Vortex Visualization for Practical Engineering Applications
TL;DR: A feature-based vortex detection and visualization technique that is appropriate for large computational fluid dynamics data sets computed on unstructured meshes is presented and a novel technique to handle complex vortex topology that is based on k-means clustering is developed.
References
More filters
Journal ArticleDOI
Multidimensional binary search trees used for associative searching
TL;DR: The multidimensional binary search tree (or k-d tree) as a data structure for storage of information to be retrieved by associative searches is developed and it is shown to be quite efficient in its storage requirements.
Book
Computational Geometry: Algorithms and Applications
TL;DR: In this article, an introduction to computational geometry focusing on algorithms is presented, which is related to particular applications in robotics, graphics, CAD/CAM, and geographic information systems.
Book
The visualization toolkit
William J. Schroeder,Ken Martin +1 more
TL;DR: The Visualization Toolkit (VTK) as mentioned in this paper is an open-source, object-oriented software system providing a toolkit of functionality for 3D data visualization, which is used for large-scale data visualization.
Journal ArticleDOI
Octrees for faster isosurface generation
Jane Wilhelms,Allen Van Gelder +1 more
TL;DR: A new space-efficient design is introduced for octree representations of volumes whose resolutions are not conveniently a power of two; octrees following this design are called branch-on-need octrees (BONOs).
Journal ArticleDOI
Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
TL;DR: This paper presents a very simple incremental randomized algorithm for computing the trapezoidal decomposition induced by a set S of n line segments in the plane that creates a search structure of expected linear size that allows point location queries in the resulting trapezoidation in logarithmic expected time.
Related Papers (5)
Fast, Memory-Efficient Cell Location in Unstructured Grids for Visualization
Christoph Garth,Kenneth I. Joy +1 more