Visualizing a channel router: An experimental study
In this paper, visualization techniques are applied to the implementation and analysis of a known channel routing algorithm. The main features of the algorithm are visualized in order to make easier the user's approach to it.
Unable to display preview. Download preview PDF.
- 1.B.S. Baker, S.N. Bhatt, and T. Leighton, An Approximation Algorithm for Manhattan Routing, Advances in Computing Research 2, 205–229 (1984).Google Scholar
- 2.M.H.Brown, Exploring Algorithms Using Balsa-II, Computer, 14–36 (1988).Google Scholar
- 3.R.A.Duisberg, Visual Programming of Program Visualizations, Proc.Conf.Visual Languages (1987).Google Scholar
- 4.R.L.London and R.A.Duisberg, Animating Programs Using Smalltalk, Computer, 61–71 (1985).Google Scholar