A Compact Cell Structure for Scientific Visualization
W. J. Schroeder, Boris Yamrom · 1997
Well designed data structures and access methods are vital to developing efficient visualization algorithms. The cell structure is a compact, general data structure for representing ndimensional topological constructs such as unstructured grids, polygonal, or triangle strip representations. The cell structure also provides constant time access methods for a wide variety of visualization algorithms. This paper describes the representation, access methods, and implementation of the cell structure. Sample algorithms such as decimation, triangle strip generation, and streamline propagation are used to illustrate its application. 1.0 Introduction The bulk of the visualization literature is oriented towards algorithms and graphical representational schemes[1],[2],[3]. Data structures, if described at all, are often presented superficially. However it is only with well designed combinations of both algorithm and data structure that useful visualization techniques can be created[4]. Visualiza...