Adaptive algorithm for vector field interpolation based on octree structure

  • Authors:
  • Pavel Tisnovsky;Adam Herout

  • Affiliations:
  • Brno University of Technology, Faculty of Information Technology;Brno University of Technology, Faculty of Information Technology

  • Venue:
  • SCCG '02 Proceedings of the 18th spring conference on Computer graphics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Computer graphics helps mathematicians and physicians visualize calculations and processed data. Visualization algorithms operating on vector field [9], [13], such as particle-tracing, require continuous (defined for every (x, y, z) position within the space), not necessarily very accurate, but fast and smooth interpolation of the field values. We offer a way of storing vector field in an octree structure, which offers some degree of compression and adaptive density of sampling of the vector field.The presented algorithm solves adaptive interpolation of vectors stored in octree. Our experiments show that this algorithm gives better results than interpolation in a regular grid without requiring more computation time.