Models and techniques for the visualization of labeled discrete objects
Dinesh P. Mehta, Sartaj K. Sahni · 1992
A general technique for the visualization of discrete objects is presented.This technique which consists of identifying simifar substructures within the structure and color coding them is demonstrated by applying it to linear strings, circular strings, binary trees, and series-parallel graphs.The problem of display conflicts which is encountered while applying this technique is described and methods to deal with it are suggested.Some of these methods are interactive in nature.Queries that would be supported in such an environment are described.Efficient algorithms to implement some of the queries are developed.The performance of these algorithms is studied, both theoretically and experimentally.We also demonstrate that our algorithms are well-suited for implementation using the object-oriented paradigm. Applicationsof our techniques arise in such diverse areas w molecular biology, text analysis, analysis of numerical sequences, computer vision, computer graphics, computeraided design, data compression, algorithm animation, and debuggers.