Publication detail
Adaptive Algorithm for Vector Field Interpolation Based on Octree Structure
TIŠNOVSKÝ, P., HEROUT, A.
Original Title
Adaptive Algorithm for Vector Field Interpolation Based on Octree Structure
English Title
Adaptive Algorithm for Vector Field Interpolation Based on Octree Structure
Type
conference paper
Language
en
Original Abstract
Visualization algorithms operating on vector field, such as particle-tracing, require continuous (defined for every position within the space), not necessarily very accurate, but fast and smooth interpolation of the field values. We present 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.
English abstract
Visualization algorithms operating on vector field, such as particle-tracing, require continuous (defined for every position within the space), not necessarily very accurate, but fast and smooth interpolation of the field values. We present 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.
Keywords
Octree, Quadtree, Particle systems, Particle tracing, Vector field, Voxels, Trilinear interpolation
RIV year
2003
Released
26.04.2002
Publisher
Slovak University of Technology in Bratislava
Location
Budmerice
ISBN
80-223-1730-6
Book
Spring Conference on Computer Graphics Proceedings 2002
Pages from
145
Pages to
150
Pages count
6
Documents
BibTex
@inproceedings{BUT10016,
author="Pavel {Tišnovský} and Adam {Herout}",
title="Adaptive Algorithm for Vector Field Interpolation Based on Octree Structure",
annote="Visualization algorithms operating on vector field, such as particle-tracing, require continuous (defined for every position within the space), not necessarily very accurate, but fast and smooth interpolation of the field values. We present 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.",
address="Slovak University of Technology in Bratislava",
booktitle="Spring Conference on Computer Graphics Proceedings 2002",
chapter="10016",
institution="Slovak University of Technology in Bratislava",
year="2002",
month="april",
pages="145--150",
publisher="Slovak University of Technology in Bratislava",
type="conference paper"
}