Octrees for faster isosurface generation
J Wilhelms, A Van Gelder - ACM Transactions on Graphics (TOG), 1992 - dl.acm.org
J Wilhelms, A Van Gelder
ACM Transactions on Graphics (TOG), 1992•dl.acm.orgThe large size of many volume data sets often prevents visualization algorithms from
providing interactive rendering. The use of hierarchical data structures can ameliorate this
problem by storing summary information to prevent useless exploration of regions of little or
no current interest within the volume. This paper discusses research into the use of the
octree hierarchical data structure when the regions of current interest can vary during the
application, and are not known a priori. Octrees are well suited to the six-sided cell structure …
providing interactive rendering. The use of hierarchical data structures can ameliorate this
problem by storing summary information to prevent useless exploration of regions of little or
no current interest within the volume. This paper discusses research into the use of the
octree hierarchical data structure when the regions of current interest can vary during the
application, and are not known a priori. Octrees are well suited to the six-sided cell structure …
The large size of many volume data sets often prevents visualization algorithms from providing interactive rendering. The use of hierarchical data structures can ameliorate this problem by storing summary information to prevent useless exploration of regions of little or no current interest within the volume. This paper discusses research into the use of the octree hierarchical data structure when the regions of current interest can vary during the application, and are not known a priori. Octrees are well suited to the six-sided cell structure of many volumes.
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). Also, a caching method is described that essentially passes information between octree neighbors whose visitation times may be quite different, then discards it when its useful life is over.
Using the application of octrees to isosurface generation as a focus, space and time comparisons for octree-based versus more traditional “marching” methods are presented.