Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
B.S. Baker, S.N. Bhatt, and T. Leighton, An Approximation Algorithm for Manhattan Routing, Advances in Computing Research 2, 205–229 (1984).
M.H.Brown, Exploring Algorithms Using Balsa-II, Computer, 14–36 (1988).
R.A.Duisberg, Visual Programming of Program Visualizations, Proc.Conf.Visual Languages (1987).
R.L.London and R.A.Duisberg, Animating Programs Using Smalltalk, Computer, 61–71 (1985).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Codenotti, B., Montani, C. (1989). Visualizing a channel router: An experimental study. In: Maurer, H. (eds) Computer Assisted Learning. ICCAL 1989. Lecture Notes in Computer Science, vol 360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51142-3_50
Download citation
DOI: https://doi.org/10.1007/3-540-51142-3_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51142-7
Online ISBN: 978-3-540-46163-0
eBook Packages: Springer Book Archive