The Community for Technology Leaders
Green Image
Issue No. 06 - November/December (2010 vol. 16)
ISSN: 1077-2626
pp: 1541-1550
Christoph Garth , University of California, Davis
Kenneth I. Joy , University of California, Davis
Applying certain visualization techniques to datasets described on unstructured grids requires the interpolation of variables of interest at arbitrary locations within the dataset's domain of definition. Typical solutions to the problem of finding the grid element enclosing a given interpolation point make use of a variety of spatial subdivision schemes. However, existing solutions are memory- intensive, do not scale well to large grids, or do not work reliably on grids describing complex geometries. In this paper, we propose a data structure and associated construction algorithm for fast cell location in unstructured grids, and apply it to the interpolation problem. Based on the concept of bounding interval hierarchies, the proposed approach is memory-efficient, fast and numerically robust. We examine the performance characteristics of the proposed approach and compare it to existing approaches using a number of benchmark problems related to vector field visualization. Furthermore, we demonstrate that our approach can successfully accommodate large datasets, and discuss application to visualization on both CPUs and GPUs.
unstructured grids, cell location, interpolation, vector field visualization

K. I. Joy and C. Garth, "Fast, Memory-Efficient Cell Location in Unstructured Grids for Visualization," in IEEE Transactions on Visualization & Computer Graphics, vol. 16, no. , pp. 1541-1550, 2010.
90 ms
(Ver 3.3 (11022016))