Models and techniques for the visualization of labeled discrete objects

The objective of visualization is to extract useful and relevant information from raw data and present it so that it can be easily understood and assimilated by humans. We propose a general model for the visualization of labeled discrete objects. (Examples of labeled discrete objects are strings, circular strings, trees, graphs, etc.) Our model is based on identifying similar subobjects in an object and coding them visually. This is demonstrated by applying the model to linear and circular strings, binary trees, and series-parallel graphs. We also describe and classify the problem of display conflicts that is associated with this visualization model and suggest methods to overcome it. We extend the csdawg data structure for linear strings to circular strings. Efficient, often optimal, algorithms to implement the visualization model for linear and circular strings, binary trees, and series-parallel graphs are also developed. These algorithms are specifically designed to utilize the inheritance and data abstraction features of the object-oriented paradigm. Several of these algorithms were implemented in C++ to evaluate their performance. We also propose a blueprint for a visualization system based on our visualization model. Applications of this visualization technique arise in areas such as molecular biology, computer vision, computer graphics, CAD VLSI, data compression, algorithm animation, and debuggers.