Back to articles
Volume: 29 | Article ID: art00014
Closest Point Sparse Octree for Surface Flow Visualization
  DOI :  10.2352/ISSN.2470-1173.2017.1.VDA-396  Published OnlineJanuary 2017

As datasets continue to increase in size and complexity, new techniques are required to visualize surface flow effectively. In this work, we introduce a novel technique for visualizing flow on arbitrary surface meshes. This new method utilizes the closest point method (CPM), an embedding technique for solving partial differential equations (PDE) on surfaces. The CPM operates by extending values off the surface into the grid and using standard three dimensional PDE stencils to solve embedded two dimensional surface problems. To adapt unsteady flow visualization for the CPM, unsteady flow line integral convolution (UFLIC) is applied in three dimensions to the embedded surface in the grid to visualize flow on an arbitrary surface. To address the increased size and complexity of datasets, we introduce the closest point sparse octree to efficiently represent an embedded surface. By constructing a closest point sparse octree, complex surfaces can be represented in a memory efficient manner. Further, various techniques, such as a Laplacian filter, can be applied more easily to the embedded surface because of the CPM. Finally, the memory efficiency of our new sparse octree approach allows grids to be constructed up to 8, 1923 in size on a GPU with 12GB of RAM.

Subject Areas :
Views 65
Downloads 0
 articleview.views 65
 articleview.downloads 0
  Cite this article 

Mark Kim, Charles Hansen, "Closest Point Sparse Octree for Surface Flow Visualizationin Proc. IS&T Int’l. Symp. on Electronic Imaging: Visualization and Data Analysis,  2017,  pp 131 - 139,

 Copy citation
  Copyright statement 
Copyright © Society for Imaging Science and Technology 2017
Electronic Imaging
Society for Imaging Science and Technology